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
Year of publication: |
1997
|
---|---|
Authors: | Salomon, M. ; Solomon, M.M. ; Wassenhove, L.M.Van ; Dumas, Y. ; Dauzère-Pérès, S. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 100.1997, 3, p. 494-513
|
Saved in:
Saved in favorites
Similar items by person
-
A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
Ioachim, I., (1995)
-
Desaulniers, G., (1997)
-
Quantitative models for reverse logistics: A review
Fleischmann, M., (1997)
- More ...