Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

Operations Research Letters

Volumn 31, Issue 2, 2003, Pages 142-148

  Della Croce, F ^a   T'kindt, V ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITÉ DE TOURS   (France)

Author keywords

Lower bound; Preemption; Single machine scheduling; Total completion time

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

PREEMPTION;

TIME SHARING SYSTEMS;

EID: 0037365445     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00215-8     Document Type: Article

References (16)

1. Ahmadi R.H., Bagchi U. Lower bounds for single-machine scheduling problems. Nav. Res. Logistics. 37:1990;967-979.
2. Baker K.R. Introduction to Sequencing and Scheduling. 1974;Wiley, New York.
3. Chand S., Traub R., Uzsoy R. Single-machine scheduling with dynamic arrivals. decomposition results and an improved algorithm Nav. Res. Logistics. 43:1996;709-716.
4. Chand S., Traub R., Uzsoy R. An iterative heuristic for the single machine dynamic total completion time scheduling problem. Comput. Oper. Res. 23:1996;641-651.
5. Chand S., Traub R., Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Ann. Oper. Res. 70:1997;115-125.
6. Chandra R. On. n|1|F̄ dynamic deterministic problems Nav. Res. Logistics. 26:1979;537-544.
7. Chu C. Efficient heuristics to minimize total flow time with release dates. Oper. Res. Lett. 12:1992;321-330.
8. Chu C. A branch-and-bound algorithm to minimize total tardiness with different release dates. Nav. Res. Logistics. 39:1992;265-283.
9. Chu C. A branch-and-bound algorithm to minimize total flow time with unequal release dates. Nav. Res. Logistics. 39:1992;859-875.
10. F. Della Croce, V. T'kindt, A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem, J. Oper. Res. Soc. 53 (2002) 1275-1280.
11. Dessouky M.I., Deogun J.S. Sequencing jobs with unequal ready times to minimize mean flow time. SIAM J. Comput. 10:1981;192-202.
12. Kellerer H., Tautenhahn T., Woeginger G.J. Approximability and non approximability results for minimizing total flow time on a single machine. SIAM J. Comput. 28:1999;1155-1166.
13. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol 4: Logistics of Production and Inventory, North-Holland, Amsterdam, 1993.
14. Liu J., MacCarthy B.L. Effective heuristics for the single machine sequencing problem with ready times. Int. J. Prod. Res. 29:1991;1521-1533.
15. Reeves C. Heuristics for scheduling a single machine subject to unequal job release times. Eur. J. Oper. Res. 80:1995;397-403.
16. Smith W.E. Various optimizers for single-state production. Nav. Res. Logistics Quarterly. 3:1956;56-66.