An efficient exact algorithm for general single-machine scheduling with machine idle time

4th IEEE Conference on Automation Science and Engineering, CASE 2008

Volumn , Issue , 2008, Pages 371-376

  Tanaka, Shunji ^a   Fujikuma, Shuji ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; DYNAMIC PROGRAMMING; MACHINERY; SCHEDULING; SYSTEMS ENGINEERING;

ADDITIONAL CONSTRAINTS; COMPUTATIONAL EFFORTS; EFFICIENT EXACT ALGORITHMS; EXACT ALGORITHMS; LAGRANGIAN RELAXATIONS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MACHINE IDLES; MEMORY USAGES; ORIGINAL PROBLEMS; SINGLE-MACHINE; WEIGHTED EARLINESSES;

SCHEDULING ALGORITHMS;

EID: 54949151972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COASE.2008.4626508     Document Type: Conference Paper

References (24)

1. S. Tanaka, "An Exact Algorithm for Single-Machine Scheduling without Idle Time," in Third Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA2007), Paris, France, 2007, pp. 314-317.
2. S. Tanaka, S. Fujikuma and M. Araki, An Exact Algorithm for Single-Machine Scheduling without Machine Idle Time, submitted to Journal of Scheduling.
3. C.A. Yano and Y.-D. Kim, Algorithms for a Class of Single-Machine Weighted Tardiness and Earliness Problems, European Journal of Operational Research, vol. 52, 1991, pp. 167-178.
4. J.S. Davis and J.J. Kanet, Single-Machine Scheduling with Early and Tardy Completion Costs, Naval Research Logistics, vol. 40, 1993, pp. 85-101.
5. Y.-D. Kim and C.A. Yano, Minimizing Mean Tardiness and Earliness in Single-Machine Scheduling Problems with Unequal Due Dates, Naval Research Logistics, vol. 41, 1994, pp. 913-933.
6. T.D. Fry, R.D. Armstrong, K. Darby-Dowman and P.R. Philipoom, A Branch and Bound Procedure to Minimize Mean Absolute Lateness on a Single Processor, Computers & Operations Research, vol. 23, 1996, pp. 171-182.
7. J.A. Hoogeveen and S.L. van de Velde, A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time, INFORMS Journal on Computing, vol. 8, 1996, pp. 402-412.
8. P.C. Chang, A Branch and Bound Approach for Single Machine Scheduling with Earliness and Tardiness Penalties, Computers and Mathematics with Applications, vol. 37, 1999, pp. 133-144.
9. F. Sourd and S. Kedad-Sidhoum, The One-Machine Problem with Earliness and Tardiness Penalties, Journal of Scheduling, vol. 6, 2003, pp. 533-549.
10. F. Sourd and S. Kedad-Sidhoum, A Faster Branch-and-Bound Algorithm for the Earliness-Tardiness Scheduling Problem, Journal of Scheduling, vol. 11, 2008, pp. 49-58.
11. H. Yau, Y Pan and L. Shi, New Solution Approaches to the General Single Machine Earliness-Tardiness Problem, IEEE Transactions on Automation Science and Engineering, vol. 5, 2008, pp. 349-360.
12. F. Sourd, A New Lower Bound for One-Machine Earliness-Tardiness Scheduling, working paper, 2007. Available from http://www.optimization- online.org/DB_HTML/2007/06/1694.html.
13. N. Christofides, A. Mingozzi and P. Toth, State-Space Relaxation Procedures for the Computation of Bounds to Routing Problems, Networks, vol. 11, 1981, pp. 145-164.
14. T.S. Abdul-Razaq and C.N. Potts, Dynamic Programming State-Space Relaxation for Single-Machine Scheduling, Journal of the Operational Research Society, vol. 39, 1988, pp. 141-152.
15. T. Ibaraki and Y. Nakamura, A Dynamic Programming Method for Single Machine Scheduling, European Journal of Operational Research, vol. 76, 1994, pp. 72-82.
16. T. Ibaraki, Enumerative Approaches to Combinatorial Optimization, Annals of Operations Research, vols. 10 and 11, 1987.
17. F. Sourd, "A Reinforced Lagrangean Relaxation for Non-Preemptive Single Machine Problem," in Proceedings of Tenth International Workshop on Project Management and Scheduling, Poznań, Poland, 2006.
18. S. Tanaka, S. Fujikuma and M. Araki, "A Branch-And-Bound Algorithm Based on Lagrangian Relaxation for Single-Machine Scheduling," in International Symposium on Scheduling 2006, Tokyo, Japan, 2006, pp. 148-153.
19. C.N. Potts and L.N. Van Wassenhove, A Branch and Bound Algorithm for the Total Weighted Tardiness Problem, Operations Research, vol. 33, 1985, pp. 363-377.
20. F. Sourd, Optimal Timing of a Sequence of Tasks with General Completion Cost, European Journal of Operational Research, vol. 165, 2005, pp. 82-96.
21. R.K. Congram, C.N. Potts and S.L. van de Velde, An Iterated Dynasearch Algorithm for the Single Machine Total Weighted Tardiness Scheduling Problem, INFORMS Journal on Computing, vol. 14, 2002, pp. 52-67.
22. A. Grosso, F. Delia Croce and R. Tadei, An Enhanced Dynasearch Neighborhood for the Single Machine Total Weighted Tardiness Scheduling Problem, Operations Research Letters, vol. 32, 2004, pp. 68-72.
23. F. Sourd: Dynasearch for the Earliness-Tardiness Scheduling Problem with Release Dates and Setup Constraints, Operations Research Letters, vol. 34, 2006, pp. 591-598.
24. K. Bülbül, P. Kaminsky and C. Yano, Preemption in Single Machine Earliness/Tardiness Scheduling, Journal of Scheduling, vol. 10, 2007, pp. 271-292.