The one-machine just-in-time scheduling problem with preemption

Discrete Optimization

Volumn 6, Issue 1, 2009, Pages 10-22

  Hendel, Yann ^a   Runge, Nina ^a   Sourd, Francis ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b SNCF   (France)

Author keywords

Just in time; Preemption; Single machine scheduling

Indexed keywords

LEARNING ALGORITHMS; MACHINERY; PHILOSOPHICAL ASPECTS;

BRANCH AND BOUNDS; COMPLETION TIMES; COST MODELS; EARLINESS AND TARDINESS PENALTIES; JUST IN TIMES; JUST-IN-TIME; JUST-IN-TIME SCHEDULING; LOCAL SEARCH ALGORITHMS; NEW MODELS; POLYNOMIAL ALGORITHMS; PREEMPTION; SINGLE-MACHINE SCHEDULING; UPPER BOUNDS;

SCHEDULING;

EID: 56249099657     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2008.08.001     Document Type: Article

References (21)

1. Aho A.V., and Ullman J.D. Foundation of Computer Science (1994), W.H. Freeman
2. Ahuja R.K., Hochbaum D.S., and Orlin J.B. Solving the convex cost integer dual network flow problem. Management Science 49 (2003) 950-964
3. Bang-Jensen J., and Gutin G. Digraphs: Theory, Algorithms and Applications (2000), Springer-Verlag
4. Bülbül K., Kaminsky P., and Yano C. Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling 10 (2007) 271-292
5. Chrétienne Ph., and Sourd F. Scheduling with convex cost functions. Theoretical Computer Science 292 (2003) 145-164
6. Davis J.S., and Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Research Logistics 40 (1993) 85-101
7. Esteve B., Aubijoux C., Chartier A., and T'kindt V. A recovering beam search algorithm for the single machine Just-in-time scheduling problem. European Journal of Operational Research 172 (2006) 798-813
8. Garey M.R., Tarjan R.E., and Wilfong G.T. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13 (1988) 330-348
9. 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
10. Hendel Y., and Sourd F. An improved earliness-tardiness timing algorithm. Computers & Operations research 34 (2007) 2931-2938
11. 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
12. Hoogeveen J.A., and van de Velde S.L. Scheduling with target start times. European Journal of Operational Research 129 (2001) 87-94
13. Karzanov A.V., and McCormick S.T. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing 26 (1997) 1245-1275
14. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
15. Pan Y., and Shi L. Dual Constrained single machine sequencing to minimize total weighted completion time. IEEE Transactions on Automation Science and Engineering 2 (2005) 344-357
16. Sourd F., and Kedad-Sidhoum S. The one-machine scheduling with earliness and tardiness penalties. Journal of Scheduling 6 (2003) 533-549
17. Sourd F. Optimal Timing of a sequence of tasks with general completion costs. European Journal of Operational Research 165 (2005) 82-96
18. 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
19. Szwarc W., and Mukhopadhyay S.K. Optimal timing schedules in earliness-tardiness single machine sequencing. Naval Research Logistics 42 (1995) 1109-1114
20. Tardos É. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34 (1986) 250-256
21. Wan G., and Yen B.P.C. Tabu search for single machine with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142 (2002) 271-281