Journal of Scheduling

, Volume 15, Issue 3, pp 347–361 | Cite as

A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

  • Shunji Tanaka
  • Shuji Fujikuma


This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors’ previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle time and next propose several improvements. Then, the proposed algorithm is applied to four types of single-machine scheduling problems: the total weighted earliness-tardiness problem with equal (zero) release dates, that with distinct release dates, the total weighted completion time problem with distinct release dates, and the total weighted tardiness problem with distinct release dates. Computational experiments demonstrate that our algorithm outperforms existing exact algorithms and can solve instances of the first three problems with up to 200 jobs and those of the last problem with up to 80 jobs.


Single-machine scheduling Machine idle time Exact algorithm Lagrangian relaxation Dynamic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Abdul-Razaq, T. S., & Potts, C. N. (1988). Dynamic programming state-space relaxation for single-machine scheduling. The Journal of the Operational Research Society, 39, 141–152. Google Scholar
  2. Akturk, M. S., & Ozdemir, D. (2000). An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions, 32, 1091–1101. CrossRefGoogle Scholar
  3. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems. Dordrecht: Kluwer Academic. Google Scholar
  4. Belouadah, H., Posner, M. E., & Potts, C. N. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36, 213–231. CrossRefGoogle Scholar
  5. Bianco, L., & Ricciardelli, S. (1982). Scheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Research Logistics Quarterly, 29, 151–167. CrossRefGoogle Scholar
  6. Brucker, P., Jurisch, B., & Krarner, A. (1994). The job-shop problem and immediate selection. Annals of Operation Research, 50, 73–114. CrossRefGoogle Scholar
  7. Bülbül, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling, 10, 271–292. CrossRefGoogle Scholar
  8. Carlier, J., & Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35, 164–176. CrossRefGoogle Scholar
  9. Carlier, J., & Pinson, E. (1990). A practical use of Jackson’s preemptive scheduling for solving the job-shop problem. Annals of Operation Research, 26, 268–287. Google Scholar
  10. Carlier, J., & Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78, 146–161. CrossRefGoogle Scholar
  11. Chang, P. C. (1999). A branch and bound approach for single machine scheduling with earliness and tardiness penalties. Computers & Mathematics With Applications, 37, 133–144. CrossRefGoogle Scholar
  12. Christofides, N., Mingozzi, A., & Toth, P. (1981). State-space relaxation procedures for the computation of bounds to routing problems. Networks, 11, 145–164. CrossRefGoogle Scholar
  13. Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002). An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14, 52–67. CrossRefGoogle Scholar
  14. Davis, J. S., & Kanet, J. J. (1993). Single-machine scheduling with early and tardy completion costs. Naval Research Logistics, 40, 85–101. CrossRefGoogle Scholar
  15. Detienne, B., Pinson, É., & Rivreau, D. (2010). Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates. European Journal of Operational Research, 201, 45–54. CrossRefGoogle Scholar
  16. Dyer, M. E., & Wolsey, L. A. (1990). Formulating the single-machine sequencing problem with release dates as a mixed integer problem. Discrete Applied Mathematics, 26, 255–270. CrossRefGoogle Scholar
  17. Fisher, M. L. (1985). An applications oriented guide to Lagrangian relaxation. Interfaces, 15, 10–21. CrossRefGoogle Scholar
  18. Fry, T. D., Armstrong, R. D., Darby-Dowman, K., & Philipoom, P. R. (1996). A branch and bound procedure to minimize mean absolute lateness on a single processor. Computers & Operations Research, 23, 171–182. CrossRefGoogle Scholar
  19. Gélinas, S., & Soumis, F. (1997). A dynamic programming algorithm for single machine scheduling with ready times. Annals of Operation Research, 69, 135–156. CrossRefGoogle Scholar
  20. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326. CrossRefGoogle Scholar
  21. Grosso, A., Della Croce, F., & Tadei, R. (2004). An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem. Operations Research Letters, 32, 68–72. CrossRefGoogle Scholar
  22. Hariri, A. M. A., & Potts, C. N. (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics, 5, 99–109. CrossRefGoogle Scholar
  23. Hoogeveen, J. A., & van de Velde, S. L. (1996). A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing, 8, 402–412. CrossRefGoogle Scholar
  24. Ibaraki, T. (1987). Enumerative approaches to combinatorial optimization. Annals of Operations Research, 10 and 11. Google Scholar
  25. Ibaraki, T., & Nakamura, Y. (1994). A dynamic programming method for single machine scheduling. European Journal of Operational Research, 76, 72–82. CrossRefGoogle Scholar
  26. Jouglet, A., Baptiste, P., & Carlier, J. (2004). Branch-and-bound algorithms for total weighted tardiness. In J. Y.-T. Leung (Ed.), Handbook of scheduling, algorithms, models, and performance analysis. Boca Raton: CRC Press (Chap. 13). Google Scholar
  27. Kim, Y.-D., & Yano, C. A. (1994). Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics, 41, 913–933. CrossRefGoogle Scholar
  28. Pan, Y., & Shi, L. (2005). Dual constrained single machine sequencing to minimize total weighted completion time. IEEE Transactions on Automation Science and Engineering, 2, 344–358. CrossRefGoogle Scholar
  29. Pan, Y., & Shi, L. (2008). New hybrid optimization algorithms for machine scheduling problems. IEEE Transactions on Automation Science and Engineering, 5, 337–348. CrossRefGoogle Scholar
  30. Péridy, L., Pinson, É., & Rivreau, D. (2003). Using short-term memory to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research, 148, 591–603. CrossRefGoogle Scholar
  31. Potts, C. N., & Van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33, 363–377. CrossRefGoogle Scholar
  32. Pritsker, A. A. B., Watters, L. J., & Wolfe, P. M. (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16, 93–108. CrossRefGoogle Scholar
  33. Sherali, H. D., & Lim, C. (2007). Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability. INFORMS Journal on Computing, 19, 3–13. CrossRefGoogle Scholar
  34. Sherali, H. D., & Ulular, O. (1989). A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Applied Mathematics & Optimization, 20, 193–221. CrossRefGoogle Scholar
  35. Sourd, F. (2005). Optimal timing of a sequence of tasks with general completion cost. European Journal of Operational Research, 165, 82–96. CrossRefGoogle Scholar
  36. Sourd, F. (2006). Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, 34, 591–598. CrossRefGoogle Scholar
  37. Sourd, F. (2009). New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS Journal on Computing, 21, 167–175. CrossRefGoogle Scholar
  38. Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6, 533–549. CrossRefGoogle Scholar
  39. Sourd, F., & Kedad-Sidhoum, S. (2008). A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, 11, 49–58. CrossRefGoogle Scholar
  40. Sousa, J. P., & Wolsey, L. A. (1992). A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 54, 353–367. CrossRefGoogle Scholar
  41. Tanaka, S., Fujikuma, S., & Araki, M. (2009). An exact algorithm for single-machine scheduling without machine idle time. Journal of Scheduling, 12, 575–593. CrossRefGoogle Scholar
  42. van der Akker, J. M., van Hoesel, C. P. M., & Savelsbergh, M. W. P. (1999). A polyhedral approach to single-machine scheduling problems. Mathematical Programming, 85, 541–572. CrossRefGoogle Scholar
  43. van den Akker, J. M., Hurkens, C. A. J., & Savelsbergh, M. W. P. (2000). Time-indexed formulations for machine scheduling problems: column generation. INFORMS Journal on Computing, 12, 111–124. CrossRefGoogle Scholar
  44. Yano, C. A., & Kim, Y.-D. (1991). Algorithms for a class of single-machine weighted tardiness and earliness problems. European Journal of Operational Research, 52, 167–178. CrossRefGoogle Scholar
  45. Yau, H., Pan, Y., & Shi, L. (2008). New solution approaches to the general single machine earliness-tardiness problem. IEEE Transactions on Automation Science and Engineering, 5, 349–360. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Electrical EngineeringKyoto UniversityKyotoJapan

Personalised recommendations