On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

Mathematical Programming

Volumn 110, Issue 3, 2007, Pages 543-559

  Pan, Yunpeng ^a   Shi, Leyuan ^b  

^a TOMOTHERAPY INC   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Combinatorial optimization; Scheduling; Time indexing

Indexed keywords

APPROXIMATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

PROGRAMMING FORMULATION; SPECTACULAR; TIME-INDEXED BOUND; WEIGHTED TARDINESS;

TRANSPORTATION;

EID: 34249857453     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0013-4     Document Type: Article

References (21)

1. Abdul-Razaq, T.S., Potts, C.N., van Wassenhove, L.N.: (1990) A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. 26, 235-253
2. van den Akker, J.M., van Hoesel, C.P.M., Savelsbergh, M.W.P.: (1999) A polyhedral approach to single-machine scheduling problems. Math. Program. 85, 541-572
3. van den Akker, J.M., Hurkens, C.A.J., Savelsbergh, M.W.P.: (2000) Time-indexed formulations for machine scheduling problems: Column generation. INFORMS J. Comput. 12(2), 111-124
4. Applegate, D., Cook, W.: (1991) A computational study of the job-shop scheduling problem. ORSA J. Comput. 3, 149-156
5. Avella, P., Boccia, M., D'Auria, B.: (2005) Near-optimal solutions of large-scale single-machine scheduling problems. INFORMS J. Comput. 17(2), 183-191
6. Balas, E.: (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17, 941-957
7. Balas, E.: (1979) Disjunctive programming. Ann. Discrete Math. 5, 3-51
8. Bigras, L., Gamache, M., Savard, G.: (2005) Time-indexed formulations and the total weighted tardiness problem. G-2005-30, Les Cahiers du GERAD
9. Bülbül, K., Kaminsky, P., Yano, C.: (2005) Preemption in single machine earliness/tardiness scheduling. J. Sched. Forthcoming
10. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: (2001) Approximation techniques for average completion time scheduling. SIAM J. Comput. 31, 146-166
11. Congram, R.K., Potts, C.N., van de Velde, S.L.: (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 13(1), 52-67
12. Dyer, M.E., Wolsey, L.A.: (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26, 255-270
13. Gelders, L., Kleindorfer, P.R.: (1974) Coordinnating aggregate and detailed scheduling in the one-machine job shop: Part I. Theory. Oper. Res. 22, 46-60
14. Lawler, E.L.: (1964) On scheduling problems with deferral costs. Management Sci. 11(2), 280-288
15. Nemhauser, G.L., Wolsey, L.A.: (1988) Integer and Combinatorial Optimization. John Wiley, NY
16. Pan, Y.: (2003) An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. 31(6), 492-496
17. Potts, C.N., van Wassenhove, L.N.: (1985) A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33(2), 363-377
18. Queyranne, M., Schulz, A.S.: (1985) Polyhedral approaches to machine scheduling. Preprint 408/1994, Math. Dept., Tech. Univ. Berlin. Revised June 1997
19. Sourd, F., Kedad-Sidhoum, S.: (2003) The one-machine problem with earliness and tardiness penalties. J. Sched. 6, 533-549
20. Sousa, J.P.: (1989) Time indexed formulations of non-preemptive single-machine scheduling problems. Ph.D. thesis, Faculté des Sciences Appliquées, University Catholique de Louvain, Louvain-la-Neuve, Belgium
21. Sousa, J.P., Wolsey, L. A.: (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54, 353-367