Solving the single-machine sequencing problem using integer programming

Computers and Industrial Engineering

Volumn 59, Issue 4, 2010, Pages 730-735

  Baker, Kenneth R ^a   Keller, Brian ^b  

^a DARTMOUTH COLLEGE   (United States)

^b University of Arizona   (United States)

Author keywords

Integer programming; Sequencing; Tardiness problem

Indexed keywords

INTEGER PROGRAMMING FORMULATIONS; INTEGER PROGRAMMING MODELS; SEQUENCING; SEQUENCING PROBLEMS; SINGLE-MACHINE SEQUENCING PROBLEM; SINGLE-MACHINE TOTAL TARDINESS PROBLEMS; TARDINESS PROBLEM; TEST PROBLEM;

DYNAMIC PROGRAMMING; PROBLEM SOLVING;

INTEGER PROGRAMMING;

EID: 78049391572     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.07.028     Document Type: Article

References (18)

1. E.H. Bowman The schedule-sequencing problem Operations Research 7 1959 621 624
2. M. Desrochers, and G. Laporte Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints OR Letters 10 1991 27 36
3. M.E. Dyer, and L.A. Wolsey Formulating the single machine sequencing problem with release dates as a mixed integer program Discrete Applied Math 26 1990 255 270
4. M.L. Fisher A dual algorithm for the one-machine scheduling problem Mathematical Programming 11 1976 229 251
5. N.G. Hall, and M.E. Posner Generating experimental data for computational testing with machine scheduling applications Operations Research 49 2001 854 865
6. K. Khowala, A. Keha, and J. Fowler A comparison of different formulations for the non-preemptive single machine total weighted tardiness scheduling problem MISTA Proceedings 2005 643 651
7. A.S. Manne On the job shop scheduling problem Operations Research 8 1960 219 223
8. C.E. Miller, A.W. Tucker, and R.A. Zemlin Integer programming formulation of traveling salesman problems Journal of the ACM 7 1960 326 329
9. G.L. Nemhauser, and M.W.P. Savelsbergh A cutting plane algorithm for the single machine scheduling problem with release times M. Akgul, H.W. Hamacher, S. Tufekci, Combinatorial optimization: New frontiers in theory and practice 1992 Springer-Verlag 63 82
10. Y. Pan, and L. Shi On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems Mathematical Programming 110 2006 543 559
11. C.N. Potts, and L.N. Van Wassenhove A decomposition algorithm for the single machine total tardiness problem Operations Research Letters 1 1982 177 181
12. A.A.B. Pritsker, L.J. Watters, and P.M. Wolfe Multi-project scheduling with limited resources: A zero-one programming approach Management Science 16 1969 93 108
13. V. Srinivasan A hybrid algorithm for the one machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution Naval Research Logistics Quarterly 18 1971 317 327
14. E.F. Stafford, F.T. Tseng, and J.N.D. Gupta Comparative evaluation of MILP flowshop models Journal of the Operational Research Society 56 2005 88 101
15. W. Szwarc, A. Grasso, and F. Della Croce Algorithmic paradoxes of the single-machine total tardiness problem Journal of Scheduling 4 2001 93 104
16. F.T. Tseng, E.F. Stafford Jr., and J.N.D. Gupta An empirical analysis of integer programming formulations for the permutation flowshop Omega 32 2004 285 293
17. H.M. Wagner An integer programming model for machine scheduling Naval Research Logistics Quarterly 6 1959 131 140
18. L.J. Wilkerson, and J.D. Irwin An improved algorithm for scheduling independent tasks AIIE Transactions 3 1971 239 245