Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence

Abhishek Awasthi, Jörg Lässig, Oliver Kramer

Abstract

This paper considers the un-restricted case of the Common Due-Date (CDD) problem with controllable processing times. The problem consists of scheduling jobs with controllable processing times on a single machine against a common due-date to minimize the overall earliness/tardiness and the compression penalties of the jobs. The objective of the problem is to find the processing sequence of jobs, the optimal reduction in the processing times of the jobs and their completion times. In this work, we first present and prove an essential property for the controllable processing time CDD problem for the un-restricted case along with an exact linear algorithm for optimizing a given job sequence for a single machine with a run-time complexity of O(n), where n is the number of jobs. Henceforth, we implement our polynomial algorithm in conjunction with a modified Simulated Annealing (SA) algorithm and Threshold Accepting (TA) to obtain the optimal/best processing sequence while comparing the two heuristic approaches, as well. The implementation is carried out on appended CDD benchmark instances provided in the OR-library.

References

  1. Awasthi, A., Kramer, O., and Lässig, J. (2013a). Aircraft landing problem: An efficient algorithm for a given landing sequence. In 16th IEEE International Conferences on Computational Science and Engineering (CSE 2013), pages 20-27.
  2. Awasthi, A., Lässig, J., and Kramer, O. (2013b). Common due-date problem: Exact polynomial algorithms for a given job sequence. In 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013, pages 258-264.
  3. Beasley, J. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069-1072.
  4. Biskup, D. and Cheng, T. (1999). Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization, 31(3):329-336.
  5. Biskup, D. and Feldmann, M. (2001). Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Computers & Operations Research, 28(8):787 - 801.
  6. Cheng, T. (1989). Optimal due-date assignment and sequencing in a single machine shop. Applied Mathematics Letters, 2(1):21-24.
  7. Dueck, G. and Scheuer, T. (1990). Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90(1):161 - 175.
  8. Gen, M., Tsujimura, Y., and Kubota, E. (1994). Solving jobshop scheduling problems by genetic algorithm. In IEEE International Conference on Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., volume 2, pages 1577-1582.
  9. Kim, J. (2013). Genetic algorithm stopping criteria for optimization of construction resource scheduling problems. Construction Management and Economics, 31(1):3-19.
  10. Lässig, J. and Hoffmann, K. (2009). Threshold-selecting strategy for best possible ground state detection with genetic algorithms. Phys. Rev. E, 79:046702.
  11. Lässig, J. and Sudholt, D. (2011). Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization. In Proceedings of the 22nd International Conference on Algorithms and Computation, ISAAC'11, pages 405-414. Springer-Verlag.
  12. Lässig, J. and Sudholt, D. (2013). General upper bounds on the runtime of parallel evolutionary algorithms. pages 1-33.
  13. Nearchou, A. (2010). Scheduling with controllable processing times and compression costs using populationbased heuristics. International Journal of Production Research, 48(23):7043-7062.
  14. Salamon, P., Sibani, P., and Frost, R. (2002). Facts, Conjectures, and Improvements for Simulated Annealing. Society for Industrial and Applied Mathematics.
  15. Shabtay, D. and Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13):1643 - 1666.
  16. Tseng, C., Liao, C., and Huang, K. (2009). Minimizing total tardiness on a single machine with controllable processing times. Computers & Operations Research, 36(6):1852 - 1858.
  17. Wan, G. (2007). Single machine common due window scheduling with controllable job processing times. In Combinatorial Optimization and Applications, volume 4616 of Lecture Notes in Computer Science, pages 279-290. Springer Berlin Heidelberg.
  18. Yunqiang, Y., Cheng, T., Cheng, S., and Wu, C. (2013). Single-machine batch delivery scheduling with an assignable common due date and controllable processing times. Computers & Industrial Engineering, 65(4):652 - 662.
Download


Paper Citation


in Harvard Style

Awasthi A., Lässig J. and Kramer O. (2015). Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence . In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 526-534. DOI: 10.5220/0005398205260534


in Bibtex Style

@conference{iceis15,
author={Abhishek Awasthi and Jörg Lässig and Oliver Kramer},
title={Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={526-534},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005398205260534},
isbn={978-989-758-096-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence
SN - 978-989-758-096-3
AU - Awasthi A.
AU - Lässig J.
AU - Kramer O.
PY - 2015
SP - 526
EP - 534
DO - 10.5220/0005398205260534