A new model for the preemptive earliness-tardiness scheduling problem

Computers and Operations Research

Volumn 36, Issue 7, 2009, Pages 2242-2249

  Runge, Nina ^a   Sourd, Francis ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b SNCF   (France)

Author keywords

Earliness tardiness; Local search; Lower bound; Preemption; Scheduling; Timing algorithm

Indexed keywords

CONTROL THEORY; LEARNING ALGORITHMS; SCHEDULING; TIME MEASUREMENT;

EARLINESS-TARDINESS; LOCAL SEARCH; LOWER BOUND; PREEMPTION; TIMING ALGORITHM;

SCHEDULING ALGORITHMS;

EID: 57649224341     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.08.018     Document Type: Article

References (16)

1. Davis J.S., and Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Research Logistics 40 1 (1993) 85-101
2. Hoogeveen J.A., and van de Velde S.L. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing 8 (1996) 402-412
3. Sourd F., and Kedad-Sidhoum S. The one machine problem with earliness and tardiness penalties. Journal of Scheduling 6 (2003) 533-549
4. Sourd F., and Kedad-Sidhoum S. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling 11 (2008) 49-58
5. Hendel Y., and Sourd F. Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. European Journal of Operational Research 173 (2006) 108-119
6. Bülbül K., Kaminsky P., and Yano C. Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling 10 4-5 (2007) 271-292
7. Józefowska J. Just-in-time scheduling (2007), Springer, Berlin
8. Hendel Y., and Sourd F. The single machine just-in-time scheduling problem with preemptions. MISTA 2005: proceedings of the 2nd multidisciplinary international conference on scheduling: theory and applications (2005) 140-148
9. Hoogeveen J.A., and van de Velde S.L. Scheduling with target starting times. European Journal of Operational Research 129 (2001) 87-94
10. Sourd F. The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions. INFORMS Journal on Computing 16:2004;198-208.
11. Pan Y., and Shi L. On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Mathematical Programming 110 (2007) 543-559
12. Szwarc W., and Mukhopadhyay S.K. Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics 42 7 (1995) 1109-1114
13. Pan Y., and Shi L. Dual constrained single machine sequencing to minimize total weighted completion time. Automation Science and Engineering 2 4 (2005) 344-357
14. Hendel Y., and Sourd F. An improved earliness-tardiness timing algorithm. Computers & Operations Research 34 10 (2007) 2931-2938
15. Jackson JR. Scheduling a production line to minimize maximum tardiness. Research Report 43, University of California, Los Angeles, 1955. Management Science Research Project.
16. Pan Y. A combinatorial auctions perspective on min-sum scheduling problems. Available on Optimization Online, paper 1439.