New solution approaches to the general single- Machine earliness-tardiness problem

IEEE Transactions on Automation Science and Engineering

Volumn 5, Issue 2, 2008, Pages 349-359

  Yau, Hoksung ^b   Pan, Yunpeng ^a,c   Shi, Leyuan ^a,b,d  

^a IEEE

^b University of Wisconsin Madison   (United States)

^c CombineNet Inc ^*  (United States)

^d TSINGHUA UNIVERSITY   (China)

Author keywords

Branch and bound (BB); Dynamic programming (DP); Earliness tardiness (E T); Single machine

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

EARLINESS-TARDINESS (E-T); SINGLE MACHINE;

COSTS;

EID: 41949088593     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2007.895219     Document Type: Article

References (26)

1. T. S. Abdul-Razaq and C. N. Potts, "Dynamic programming state-space relaxation for single machine scheduling," J. Oper. Res. Soc., vol. 39, pp. 141-152, 1988.
2. K. R. Baker and G. D. Scudder, "Sequencing with earliness and tardiness penalties," Oper. Res., vol. 38, pp. 22-36, 1990.
3. J. F. Bard, K. Venkatraman, and T. A. Feo, "Single machine scheduling with flow time and earliness penalties," J. Global Optim., vol. 3, no. 3, pp. 289-309, 1993.
4. J. W. Barnes and L. K. Vanston, "Scheduling jobs with linear delay penalties and sequence dependent setup costs," Oper. Res., vol. 29, no. 1, pp. 146-160, 1981.
5. K. Bülbül, P. Kaminsky, and C. Yano, "Preemption in single machine earliness/tardiness scheduling," J. Scheduling, 2005, revision under review.
6. M. E. Dyer and L. A. Wolsey, "Formulating the single machine sequencing problem with release dates as a mixed integer program," Discrete Appl. Math., vol. 26, pp. 255-270, 1990.
7. T. D. Fry. R. Armstrong, and J. H. Blackstone, "Minimizing weighted absolute deviation in single machine scheduling," IIE Trans., vol. 19, no. 4, pp. 445-450, 1987.
8. S. Fujii and J. Wang, "Optimal single-machine scheduling for minimizing the sum of earliness and tardiness penalties," J. Oper. Res. Soc. Japan, vol. 31, pp. 105-120, 1988.
9. M. R. Garey, R. Tarjan, and G. Wilfong, "One-processor scheduling with symmetric earliness and tardiness penalties," Math. Oper. Res., vol. 13, pp. 330-348, 1988.
10. J. A. Hoogeveen and S. L. van de Velde, "A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time," INFORMS J. Comput., vol. 8, no. 4, pp. 402-412, 1996.
11. S. Kedad-Sidhoum, Y. R. Solis, and F. Sourd, "Lower bound for the earliness-tardiness scheduling problem on parallel machines with distinct due dates," in Proc. 9th Int. Conf. Project Manage. Scheduling. 2004, pp. 210-213.
12. G. Li, "Single machine earliness and tardiness scheduling," Eur. J. Oper. Res., vol. 96, no. 3, pp. 546-558, 1997.
13. R. Mazzini and V. A. Armentano, "A heuristic for single machine scheduling with early and tardy costs," Eur. J. Oper. Res., vol. 128, pp. 129-146, 2001.
14. T. L. Morin and R. E. Marsten, "Branch-and-bound strategies for dynamic programming," Oper. Res., vol. 24, no. 4, pp. 611-627, 1976.
15. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
16. Y. Pan and L. Shi, "On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems," Math. Programming, Series A. 2006, to be published.
17. _, "Dual constrained single machine sequencing to minimize total weighted completion time," IEEE Trans. Autom. Sci. Eng., vol. 2, no. 4, pp. 344-357, Oct. 2005.
18. _, "New hybrid optimization algorithms tor machine scheduling problems," IEEE Trans. Autom. Sci. Eng., 2006, to be published.
19. C. N. Potts and L. N. van Wassenhove, "A decomposition algorithm for the single machine total tardiness problem," Oper. Res. Lett., vol. 1, no. 5, pp. 177-181, 1982.
20. W. E. Smith, "Various optimizers for single-stage production," Naval Res. Logistics Quart., vol. 3, pp. 59-66, 1956.
21. F. Sourd, "The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions," INFORMS J. Comput., vol. 16, no. 2, pp. 198-208, 2004.
22. _, "Optimal timing of a sequence of tasks with general completion costs," Eur. J. Oper. Res., pp. 82-96, 2005.
23. F. Sourd and S. Kedad-Sidhoum, "The one-machine problem with earliness and tardiness penalties," J. Scheduling, vol. 6, pp. 533-549, 2003.
24. F. Sourd and S. Kedad-Sidhoum, "An efficient algorithm for the earliness-tardiness scheduling problem" 2005, working paper.
25. G. H. Wan and B.-C. Yen, "Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties," Eur. J. Oper. Res., vol. 142, pp. 271-281, 2002.
26. C. A. Yano and Y. Kim, "Algorithms for a class of single-machine v/eighted tardiness and earliness problems," Eur. J. Oper. Res., vol. 52, no. 167-178, 1991.