Journal of Scheduling

, Volume 10, Issue 4–5, pp 271–292 | Cite as

Preemption in single machine earliness/tardiness scheduling

Article

Abstract

We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coefficients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coefficients, we generate feasible solutions for the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.

Keywords

Single-machine scheduling Earliness Tardiness Preemption Transportation problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38(1), 22–36. Google Scholar
  2. Bülbül, K. (2002). Just-in-time scheduling with inventory holding costs. PhD thesis, University of California at Berkeley. Google Scholar
  3. Bülbül, K., Kaminsky, P., & Yano, C. A. (2004). Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Research Logistics, 51(3), 407–445. CrossRefGoogle Scholar
  4. Davis, J., & Kanet, J. (1993). Single-machine scheduling with early and tardy completion costs. Naval Research Logistics, 40(1), 85–101. CrossRefGoogle Scholar
  5. Dyer, M., & Wolsey, L. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26(2–3), 255–270. CrossRefGoogle Scholar
  6. Fry, T., & Keong Leong, G. (1987). A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden. Computers and Operations Research, 14(5), 363–368. CrossRefGoogle Scholar
  7. Fry, T., Armstrong, R., & Blackstone, J. (1987). Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions, 19(4), 445–450. CrossRefGoogle Scholar
  8. Fry, T., Armstrong, R., & Rosen, L. (1990). Single machine scheduling to minimize mean absolute lateness: a heuristic solution. Computers and Operations Research, 17(1), 105–112. CrossRefGoogle Scholar
  9. Fry, T., Armstrong, R., Darby-Dowman, K., & Philipoom, P. (1996). A branch and bound procedure to minimize mean absolute lateness on a single processor. Computers and Operations Research, 23(2), 171–182. CrossRefGoogle Scholar
  10. Garey, M., Tarjan, R., & Wilfong, G. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13(2), 330–348. Google Scholar
  11. Gelders, L., & Kleindorfer, P. (1974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop, I: theory. Operations Research, 22(1), 46–60. Google Scholar
  12. Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326. Google Scholar
  13. Hall, N., & Posner, M. (2001). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49(6), 854–865. CrossRefGoogle Scholar
  14. Hoogeveen, J., & van de Velde, S. (1996). A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing, 8(4), 402–412. CrossRefGoogle Scholar
  15. Kanet, J., & Sridharan, V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48(1), 99–110. CrossRefGoogle Scholar
  16. 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(7), 913–933. CrossRefGoogle Scholar
  17. Lee, C., & Choi, J. (1995). A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers and Operations Research, 22(8), 857–869. CrossRefGoogle Scholar
  18. Lenstra, J., Rinnooy Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362. CrossRefGoogle Scholar
  19. Mazzini, R., & Armentano, V. (2001). A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research, 128(1), 129–146. CrossRefGoogle Scholar
  20. McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1–12. Google Scholar
  21. Mosheiov, G. (1996). A note on pre-emptive scheduling with earliness and tardiness costs. Production Planning and Control, 7(4), 401–406. CrossRefGoogle Scholar
  22. Nandkeolyar, U., Ahmed, M., & Sundararaghavan, P. (1993). Dynamic single-machine-weighted absolute deviation problem: predictive heuristics and evaluation. International Journal of Production Research, 31(6), 1453–1466. CrossRefGoogle Scholar
  23. Ovacik, I. M., & Uzsoy, R. (1997). Decomposition methods for complex factory scheduling problems. Boston: Kluwer Academic. Google Scholar
  24. Phillips, C., Stein, C., & Wein, J. (1998). Minimizing average completion time in the presence of release dates. Mathematical Programming, 82, 199–223. Google Scholar
  25. Potts, C., & van Wassenhove, L. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1(5), 177–181. CrossRefGoogle Scholar
  26. Sourd, F. (2004). The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal on Computing, 16(2), 198–208. CrossRefGoogle Scholar
  27. Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533–549. CrossRefGoogle Scholar
  28. Sridharan, V., & Zhou, Z. (1996). A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. European Journal of Operational Research, 94(2), 292–301. CrossRefGoogle Scholar
  29. Srinivasan, V. (1971). A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly, 18(3), 317–327. CrossRefGoogle Scholar
  30. Szwarc, W. (1993). Adjacent orderings in single-machine scheduling with earliness and tardiness penalties. Naval Research Logistics, 40(2), 229–243. CrossRefGoogle Scholar
  31. Szwarc, W., & Mukhopadhyay, S. (1995). Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics, 42(7), 1109–1114. CrossRefGoogle Scholar
  32. Ventura, J., & Radhakrishnan, S. (2003). Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research, 144(3), 598–612. CrossRefGoogle Scholar
  33. Verma, S., & Dessouky, M. (1998). Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research, 23(4), 930–943. Google Scholar
  34. Wan, G., & Yen, B. (2002). Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research, 142(2), 271–281. CrossRefGoogle Scholar
  35. 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(2), 167–178. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Kerem Bülbül
    • 1
  • Philip Kaminsky
    • 2
  • Candace Yano
    • 2
    • 3
  1. 1.Manufacturing Systems and Industrial EngineeringSabancı UniversityIstanbulTurkey
  2. 2.Industrial Engineering and Operations ResearchUniversity of CaliforniaBerkeleyUSA
  3. 3.Haas School of BusinessUniversity of CaliforniaBerkeleyUSA

Personalised recommendations