A mixed-integer model for solving ordering problems with side constraints

Annals of Operations Research

Volumn 69, Issue , 1997, Pages 277-297

  Maffioli, Francesco ^a   Sciomachen, Anna ^b  

^a POLITECNICO DI MILANO   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031539030     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018989130169     Document Type: Article

References (19)

1. N. Ascheuer, L.F. Escudero, M. Groetchel and M. Stoer, A cutting plane approach for the sequential ordering problem (with applications to job scheduling in manufacturing), SIAM J. Optimization 3(1993)25-42.
2. K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A survey, Operations Research 38(1990)22-36.
3. E. Balas, M. Fischetti and W.R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Mathematical Programming 68(1995)241-265.
4. T.C.E. Cheng and M. Gupta, Survey of scheduling research involving due date determination decisions, European Journal of Operational Research 38(1989)156-166.
5. M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40(1992)342-354.
6. L.F. Escudero, M. Guignard and K. Malik, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, Annals of Operations Research 50(1994)219-237.
7. L.F. Escudero and A. Sciomachen, An approximate algorithm for the sequential ordering problem with time windows and precedence relationships, IBM Research Report RC 16280, 1991.
8. L.F. Escudero and A. Sciomachen, Local search procedures for improving feasible solutions to the sequential ordering problem, Annals of Operations Research 43(1993)397-416.
9. S. Gupta and S. Kyparisi, Single machine scheduling research, Omega 15(1987)207-227.
10. IBM, Optimization Subroutine Library and Reference Manual, Release 2, IBM, 1992.
11. G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59(1992)345-358.
12. J.B. Lasserre and M. Queyranne, Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling, Proc. 2nd Integer Programming and Combinatorial Optimization (IPCO), E. Balas, G. Cornéjols and R. Kannan, eds., Carnegie Mellon University, 1992, pp. 136-149.
13. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shimoys, The Traveling Salesman Problem, Wiley, 1985.
14. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity scheduling under precedence constraints, Operations Research 26(1978)22-35.
15. C.E. Miller, A.W. Tucker and R.A. Zemlin, Integer programming formulations and traveling-salesman problems, J. ACM 7(1960)326-329.
16. M. Murari, Approccio risolutivo al probleme di sequenziamento di operazioni con un algoritmo di taglio, Thesis, Computer Science Department, University of Milano, Italy, 1992 (in Italian).
17. J.C. Picard and M. Queyranne, The time-dependent traveling salesman problem and its application to the tardiness in one-machine scheduling, Operations Research 26(1978)86-110.
18. M. Queyranne and Y. Wang, Single machine scheduling polyhedra with precedence constraints, Mathematics of OR (1991).
19. M. Scarioni and A. Sciomachen, Fast prototyping for optimization models in production planning, Optimization in Industry, Vol. 3, A. Sciomachen, ed., Wiley, 1995, pp. 165-183.