{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:40:03Z","timestamp":1749724803393,"version":"3.41.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Mathematical Modelling and Algorithms"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1024979501350","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T19:31:08Z","timestamp":1063740668000},"page":"153-169","source":"Crossref","is-referenced-by-count":1,"title":["Problems, Models and Complexity. Part II: Application to the DLSP"],"prefix":"10.1007","volume":"2","author":[{"given":"W.","family":"Br\u00fcggemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Jahnke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5127622_CR1","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1287\/opre.7.5.621","volume":"7","author":"E. H. Bowman","year":"1959","unstructured":"Bowman, E. H. (1959) The schedule-sequencing problem, Oper. Res.\n7, 621\u2013624.","journal-title":"Oper. Res."},{"key":"5127622_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-99785-3","volume-title":"Ausgew\u00e4hlte Probleme der Produktionsplanung - Modellierung, Komplexit\u00e4t und neuere L\u00f6sungsm\u00f6glichkeiten","author":"W. Br\u00fcggemann","year":"1995","unstructured":"Br\u00fcggemann, W. (1995) Ausgew\u00e4hlte Probleme der Produktionsplanung - Modellierung, Komplexit\u00e4t und neuere L\u00f6sungsm\u00f6glichkeiten, Physica-Verlag, Heidelberg."},{"key":"#cr-split#-5127622_CR3.1","unstructured":"Br\u00fcggemann, W. and Jahnke, H. (1994) Remarks on: 'some extensions of the discrete lotsizing and scheduling problem' by M. Salomon, L. G. Kroon, R. Kuik and L. N. Van Wassenhove, In: Management Sci."},{"key":"#cr-split#-5127622_CR3.2","unstructured":"37(7) (1991), 801-812. Working Paper, Institut f\u00fcr Logistik und Transport, Universit\u00e4t Hamburg. Superseded by Br\u00fcggemann and Jahnke (1997)."},{"issue":"1","key":"5127622_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/mnsc.43.1.122","volume":"43","author":"W. Br\u00fcggemann","year":"1997","unstructured":"Br\u00fcggemann, W. and Jahnke, H. (1997) Remarks on: 'some extensions of the discrete lotsizing and scheduling problem', Management Sci.\n43(1), 122.","journal-title":"Management Sci."},{"issue":"3","key":"5127622_CR5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0377-2217(99)00190-3","volume":"124","author":"W. Br\u00fcggemann","year":"2000","unstructured":"Br\u00fcggemann, W. and Jahnke, H. (2000) The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Europ. J. Oper. Res.\n124(3), 511\u2013528.","journal-title":"Europ. J. Oper. Res."},{"key":"5127622_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1024998617280","volume":"2","author":"W. Br\u00fcggemann","year":"2003","unstructured":"Br\u00fcggemann, W., Fischer, K. and Jahnke, H. (2003) Problems, models and complexity. Part I: Theory, J. Math. Modelling Algorithms\n2 (2003), 121\u2013151 (this issue).","journal-title":"J. Math. Modelling Algorithms"},{"issue":"4","key":"5127622_CR7","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","volume":"39","author":"D. Cattrysse","year":"1993","unstructured":"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 setup times, Management Sci.\n39(4), 477\u2013486.","journal-title":"Management Sci."},{"key":"5127622_CR8","unstructured":"Dinkelbach,W. (1964) Zum Problem der Produktionsplanung in Ein-und Mehrproduktunternehmen, Physica-Verlag, W\u00fcrzburg."},{"key":"5127622_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A. Drexl","year":"1997","unstructured":"Drexl, A. and Kimms, A. (1997) Lot sizing and scheduling - survey and extensions, Europ. J. Oper. Res.\n99, 221\u2013235.","journal-title":"Europ. J. Oper. Res."},{"key":"5127622_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","volume":"44","author":"B. Fleischmann","year":"1990","unstructured":"Fleischmann, B. (1990) The discrete lot-sizing and scheduling problem, Europ. J. Oper. Res.\n44, 337\u2013348.","journal-title":"Europ. J. Oper. Res."},{"key":"5127622_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","volume":"75","author":"B. Fleischmann","year":"1994","unstructured":"Fleischmann, B. (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, Europ. J. Oper. Res.\n75, 395\u2013404.","journal-title":"Europ. J. Oper. Res."},{"key":"5127622_CR12","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M. R. Garey","year":"1978","unstructured":"Garey, M. R. and Johnson, D. S. (1978) 'strong\u2019 NP-completeness results: Motivation, examples, and implications, J. Assoc. Comput. Mach.\n25, 499\u2013508.","journal-title":"J. Assoc. Comput. Mach."},{"key":"5127622_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York."},{"key":"5127622_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48403-2","volume-title":"Batching and Scheduling - Models and Methods for Several Problem Classes","author":"C. Jordan","year":"1996","unstructured":"Jordan, C. (1996) Batching and Scheduling - Models and Methods for Several Problem Classes, Springer, Berlin."},{"issue":"3","key":"5127622_CR15","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1080\/002075498193679","volume":"36","author":"C. Jordan","year":"1998","unstructured":"Jordan, C. (1998) A two-phase genetic algorithm to solve variants of the batch sequencing problem, Internat. J. Prod. Res.\n36(3), 745\u2013760.","journal-title":"Internat. J. Prod. Res."},{"issue":"2","key":"5127622_CR16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1287\/ijoc.7.2.160","volume":"7","author":"C. Jordan","year":"1995","unstructured":"Jordan, C. and Drexl, A. (1995) A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups, ORSA J. Comput.\n7(2), 160\u2013165.","journal-title":"ORSA J. Comput."},{"issue":"5","key":"5127622_CR17","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/mnsc.44.5.698","volume":"44","author":"C. Jordan","year":"1998","unstructured":"Jordan, C. and Drexl, A. (1998) Discrete lotsizing and scheduling by batch sequencing, Management Sci.\n44(5), 698\u2013713.","journal-title":"Management Sci."},{"key":"5127622_CR18","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1057\/palgrave.jors.2600579","volume":"49","author":"C. Jordan","year":"1998","unstructured":"Jordan, C. and Koppelmann, J. (1998) Multi-level lotsizing and scheduling by batch sequencing, J. Oper. Res. Soc.\n49, 1212\u20131218.","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"5127622_CR19","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","volume":"38","author":"T. L. Magnanti","year":"1990","unstructured":"Magnanti, T. L. and Vachani, R. (1990) A strong cutting plane algorithm for production scheduling with changeover costs, Oper. Res.\n38(3), 456\u2013473.","journal-title":"Oper. Res."},{"issue":"2","key":"5127622_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"A. S. Manne","year":"1960","unstructured":"Manne, A. S. (1960) On the job-shop scheduling problem, Oper. Res.\n8(2), 219\u2013223.","journal-title":"Oper. Res."},{"key":"5127622_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51649-8","volume-title":"Deterministic Lotsizing Models for Production Planning","author":"M. Salomon","year":"1991","unstructured":"Salomon, M. (1991) Deterministic Lotsizing Models for Production Planning, Springer-Verlag, Berlin."},{"key":"5127622_CR22","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/mnsc.37.7.801","volume":"37","author":"M. Salomon","year":"1991","unstructured":"Salomon, M., Kroon, L. G., Kuik, R. and Van Wassenhove, L. N. (1991) Some extensions of the discrete lotsizing and scheduling problem, Management Sci.\n37, 801\u2013812.","journal-title":"Management Sci."},{"key":"5127622_CR23","unstructured":"T\u00fcrck, H. (1997) Das diskrete simultane Losgr\u00f6\u00df en-und Losreihenfolgeproblem, Diplom-Thesis (in German), Universit\u00e4t Hamburg."},{"key":"5127622_CR24","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/mnsc.45.5.768","volume":"45","author":"S. Webster","year":"1999","unstructured":"Webster, S. (1999) Remarks on 'some extensions of the discrete lotsizing and scheduling problem', Management Sci.\n45, 768\u2013769.","journal-title":"Management Sci."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024979501350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024979501350\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024979501350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:26:16Z","timestamp":1749723976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024979501350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5127622"],"URL":"https:\/\/doi.org\/10.1023\/a:1024979501350","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"type":"print","value":"1570-1166"},{"type":"electronic","value":"1572-9214"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}