Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows

European Journal of Operational Research

Volumn 100, Issue 3, 1997, Pages 494-513

  Salomon, Marc ^a   Solomon, Marius M ^b,c   Van Wassenhove, Luk N ^d   Dumas, Yvan ^e   Dauzère Pérès, Stephane ^f  

^a TILBURG UNIVERSITY   (Netherlands)

^b NORTHEASTERN UNIVERSITY   (United States)

^c GERAD   (Canada)

^d INSEAD   (France)

^e AD OPT Technologies   (Canada)

^f ECOLE DES MINES DE NANTES   (France)

Author keywords

Dynamic programming; Lotsizing; Sequencing; Travelling salesman problem with time windows

Indexed keywords

EID: 0001532011     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00020-3     Document Type: Article

References (11)

1. Cattrysse, D., Salomon, M. Kuik, R., and Van Wassenhove, L.N. (1993), "A dual ascent and column generation heuristic for the Discrete Lotsizing and Scheduling Problem with set-up times", Management Science 39/4, 477-486.
2. Desrosiers, J., Dumas, Y., Solomon, M., and Soumis, F. (1995), "Time constrained routing and scheduling. Handbooks in Operations Research and Management Science, Volume on 'Networks'", North-Holland publishers.
3. Dumas, Y., Desrosiers, J., Gelinas, E., and Solomon, M.M. (1995), "An optimal algorithm for the Travelling salesman problem with time windows", Operations Research 43/2, 367-371.
4. Fleischmann, B. (1990), "The discrete lotsizing and scheduling problem", European Journal of Operational Research 44/3, 337-348.
5. Fleischmann, B. (1994), "The discrete lot-sizing and scheduling problem with sequence-dependent set-up costs", European Journal of Operational Research 75/2, 395-404.
6. Fleischmann, B., and Popp, Th. (1989), "Das dynamische Losgrössenproblem mit reihenfolgeabhängigen Rüstkosten", in: Operations Research Proceedings 1988, Springer-Verlag, Berlin-Heidelberg, 510-515 (in German).
7. Van Hoesel, S., Kuik, R., Salomon, M., and Van Wassenhove, L.N. (1994), "The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming", Discrete Applied Mathematics 49, 289-303.
8. Jordan, C., and Drexl, A. (1994), "Lotsizing and scheduling by batch sequencing", Working paper # 343. Christian-Albrecht-Universität zu Kiel, Kiel, Germany.
9. Langevin, A., Desrochers, M., Desrosiers, J., and Soumis, F. (1990) "A two-commodity flow formulation for the Travelling salesman problem with time windows", Working Paper G90-44, GERAD, Montreal, Canada.
10. Magnanti, T.L., and Vachani, R. (1990), "A strong cutting-plane algorithm for production scheduling with changeover costs", Operations Research 38/3, 456-473.
11. Salomon, M., Kroon, L.G., Kuik, R., and Van Wassenhove L.N. (1991), "Some extensions of the discrete lotsizing and scheduling problem", Management Science 37/7, 801-812.