{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:38:19Z","timestamp":1770971899014,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0377-2217(96)00020-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"494-513","source":"Crossref","is-referenced-by-count":55,"title":["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"],"prefix":"10.1016","volume":"100","author":[{"given":"Marc","family":"Salomon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius M.","family":"Solomon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk N.","family":"Van Wassenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvan","family":"Dumas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Dauz\u00e8re-P\u00e9r\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(96)00020-3_BIB1","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","article-title":"A dual ascent and column generation heuristic for the Discrete Lotsizing and Scheduling Problem with set-up times","volume":"39\/4","author":"Cattrysse","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB2","author":"Desrosiers","year":"1995"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","article-title":"An optimal algorithm for the Travelling salesman problem with time windows","volume":"43\/2","author":"Dumas","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","article-title":"The discrete lotsizing and scheduling problem","volume":"44\/3","author":"Fleischmann","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","article-title":"The discrete lot-sizing and scheduling problem with sequence-dependent set-up costs","volume":"75\/2","author":"Fleischmann","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB6","series-title":"Operations Research Proceedings 1988","first-page":"510","article-title":"Das dynamische Losgr\u00f6ssenproblem mit reihenfolgeabh\u00e4ngigen R\u00fcstkosten","author":"Fleischmann","year":"1989"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(92)00182-L","article-title":"The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming","volume":"49","author":"Van Hoesel","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB8","series-title":"Working paper # 343","article-title":"Lotsizing and scheduling by batch sequencing","author":"Jordan","year":"1994"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB9","series-title":"Working Paper G90-44","article-title":"A two-commodity flow formulation for the Travelling salesman problem with time windows","author":"Langevin","year":"1990"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB10","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","article-title":"A strong cutting-plane algorithm for production scheduling with changeover costs","volume":"38\/3","author":"Magnanti","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(96)00020-3_BIB11","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/mnsc.37.7.801","article-title":"Some extensions of the discrete lotsizing and scheduling problem","volume":"37\/7","author":"Salomon","year":"1991","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221796000203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221796000203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:53:12Z","timestamp":1556110392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221796000203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0377221796000203"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(96)00020-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}