New exact algorithms for one-machine earliness-tardiness scheduling

INFORMS Journal on Computing

Volumn 21, Issue 1, 2009, Pages 167-175

  Sourd, Francis ^a  

^a CNRS   (France)

Author keywords

Common due date; Earliness tardiness scheduling; General due dates; Lagrangian relaxation; Time indexed formulation

Indexed keywords

EID: 67649961766     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0287     Document Type: Article

References (31)

1. Avella, P., M. Boccia, B. D'Auria. 2005. Near-optimal solutions of large-scale single-machine scheduling problems. INFORMS J. Comput. 17 183-191.
2. Baker, K. R., G. Scudder. 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38 22-36.
3. Baptiste, Ph., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling( Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Norwell, MA.
4. Beasley, J. E. 1990. OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41 1069-1072. http://people. brunel.ac.uk/∼mastjjb/jeb/info.html.
5. Biskup, D., M. Feldmann. 2001. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Comput. Oper. Res. 28 787-801.
6. Bülbül, K., P. Kaminsky, C. Yano. 2007. Preemption in single machine earliness/tardiness scheduling. J. Scheduling 10271-292.
7. Carlier, J., E. Pinson. 1989. An algorithm for solving the job-shop problem. Management Sci. 35 164-176.
8. Carlier, J., E. Pinson. 1994. Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78 146-161.
9. Christofides, N., R. Alvarez-Valdes, J. M. Tamarit. 1987. Project scheduling with resource constraints: A branch and bound approach. Eur. J. Oper. Res. 29 262-273.
10. Dyer, M. E., L. A. Wolsey. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer problem. Discrete Appl. Math. 26 255-270.
11. Fisher, M. L. 1976. A dual algorithm for the one-machine scheduling problem. Math. Programming 11 229-251.
12. Fry, T. D., G. Leong, T. Rakes. 1987. Single machine scheduling: A comparison of two solution procedures. Omega 15 277-282.
13. Fry, T. D., R. D. Armstrong, K. Darby-Dowman, P. R. Philipoom. 1996. A branch and bound procedure to minimize mean absolute lateness on a single processor. Comput. Oper. Res. 23 171-182.
14. Hall, N. G., M. E. Posner. 1991. Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Oper. Res. 39 836-846.
15. Hall, N. G., W. Kubiak, S. P. Sethi. 1991. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Oper. Res. 39 847-856.
16. Hoogeveen, J. A., S. L. van de Velde. 1996. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS J. Comput. 8 402-412.
17. Kappel, F., A. V. Kuntsevich. 2000. An implementation of Shor's r-algorithm. Computational Optim. Appl. 15 193-205.
18. Kedad-Sidhoum, S., Y. Rios-Solis, F. Sourd. 2008. Lower bounds for the earliness-tardiness scheduling problem on single and parallel machines. Eur. J. Oper. Res. 189 1305-1316.
19. Kim, Y. D., C. Yano. 1994. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Res. Logist. 41 913-933.
20. Kovalyov, M. Y., W. Kubiak. 1999. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Oper. Res. 47 757-761.
21. Martin, P. D., D. B. Shmoys. 1996. A new approach to computing optimal schedules for the job shop scheduling problem. S. T. McCormick, W. H. Curnigham, M. Queyranne, eds. Integer Programming and Combinatorial Optimization( Proc. Fifth Internat. IPCO Conf., Vancouver, BC, Canada. Lecture Notes in Computer Science, Vol. 1084. Springer, Berlin, 389-403.
22. Péridy, L., E. Pinson, D. Rivreau. 2003. Using short-term memory to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res. 148 591-603.
23. Sourd, F. 2004. The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS J. Comput. 16 198-208.
24. Sourd, F. 2007. Scheduling with periodic availability constraints and irregular cost functions. RAIRO Oper. Res. 41 141-154.
25. Sourd, F., S. Kedad-Sidhoum. 2003. The one machine problem with earliness and tardiness penalties. J. Scheduling 6 533-549.
26. Sourd, F., S. Kedad-Sidhoum. 2008. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. J. Scheduling 11 49-58.
27. Sousa, J. P. De, L. A. Wolsey. 1992. A time-indexed formulation of non-preemptive single-machine scheduling problems. Math. Programming 54 353-367.
28. Tanaka, S. 2007. An exact algorithm for single-machine scheduling without idle time. P. Baptiste, G. Kendall, A. Munier-Kordon, F. Sourd, eds. Proc. 3rd Multidisciplinary Internat. Conf. Scheduling( Theory and Appl. (MISTA), Paris, 314-317.
29. van den Akker, M., H. Hoogeveen, S. van de Velde. 2002. Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem. INFORMS J. Comput. 14 35-51.
30. van den Akker, M., C. A. J. Hurkens, M. W. P. Savelsbergh. 2000. Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J. Comput. 12 111-124.
31. Yau, H., Y. Pan, L. Shi. 2008. New solution approaches to the general single machine earliness-tardiness problem. IEEE Trans. Automation Sci. Engrg. 5(2) 349-360.