{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:44:39Z","timestamp":1775594679660,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10951-010-0197-6","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T02:26:07Z","timestamp":1284517567000},"page":"209-219","source":"Crossref","is-referenced-by-count":43,"title":["Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups"],"prefix":"10.1007","volume":"14","author":[{"given":"Ant\u00f3nio Aroso","family":"Menezes","sequence":"first","affiliation":[]},{"given":"Alistair","family":"Clark","sequence":"additional","affiliation":[]},{"given":"Bernardo","family":"Almada-Lobo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"issue":"20","key":"197_CR1","doi-asserted-by":"crossref","first-page":"4873","DOI":"10.1080\/00207540601094465","volume":"45","author":"B. Almada-Lobo","year":"2007","unstructured":"Almada-Lobo, B., Klabjan, D., Oliveira, J. F., & Carravilla, M. A. (2007). Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45(20), 4873\u20134894.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"197_CR2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E. (1989). The prize collecting traveling salesman problem. Networks, 19(6), 621\u2013636.","journal-title":"Networks"},{"issue":"10","key":"197_CR3","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1080\/00207540050028106","volume":"38","author":"A. R. Clark","year":"2000","unstructured":"Clark, A. R., & Clark, S. J. (2000). Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research, 38(10), 2287\u20132307.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"197_CR4","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., & Kimms, A. (1997). Lot sizing and scheduling\u2014survey and extensions. European Journal of Operational Research, 99(2), 221\u2013235.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"197_CR5","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. European Journal of Operational Research, 75(2), 395\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"197_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B. Fleischmann","year":"1997","unstructured":"Fleischmann, B., & Meyr, H. (1997). The general lotsizing and scheduling problem. OR Spektrum, 19, 11\u201321.","journal-title":"OR Spektrum"},{"issue":"14","key":"197_CR7","doi-asserted-by":"crossref","first-page":"3421","DOI":"10.1080\/002075400418324","volume":"38","author":"M. Gopalakrishnan","year":"2000","unstructured":"Gopalakrishnan, M. (2000). A modified framework for modelling set-up carry over in the capacitated lotsizing problem. International Journal of Production Research, 38(14), 3421\u20133424.","journal-title":"International Journal of Production Research"},{"issue":"7","key":"197_CR8","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1080\/00207549508904793","volume":"33","author":"M. Gopalakrishnan","year":"1995","unstructured":"Gopalakrishnan, M., Miller, D. M., & Schmidt, C. P. (1995). A framework for modelling setup carryover in the capacitated lot sizing problem. International Journal of Production Research, 33(7), 1973\u20131988.","journal-title":"International Journal of Production Research"},{"key":"197_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01539882","volume":"18","author":"K. Haase","year":"1996","unstructured":"Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum, 18, 51\u201359.","journal-title":"OR Spektrum"},{"key":"197_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(99)00119-X","volume":"66","author":"K. Haase","year":"2000","unstructured":"Haase, K., & Kimms, A. (2000). Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159\u2013169.","journal-title":"International Journal of Production Economics"},{"key":"197_CR11","unstructured":"Instances (2009). URL http:\/\/paginas.fe.up.pt\/~balobo\/NonTriangular-Setups ."},{"issue":"2","key":"197_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G. (1992a). The travelling salesman problem: an overview of exact and approximated algorithms. European Journal of Operational Research, 59(2), 231\u2013248.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"197_CR13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G. (1992b). The vehicle routing problem: an overview of exact and approximated algorithms. European Journal of Operational Research, 59(2), 345\u2013358.","journal-title":"European Journal of Operational Research"},{"issue":"14","key":"197_CR14","doi-asserted-by":"crossref","first-page":"3421","DOI":"10.1080\/002075400418324","volume":"38","author":"P. Porkka","year":"2000","unstructured":"Porkka, P., & Kuula, A. P. J. V. M. (2000). A modified framework for modelling set-up carryover in the capacitated lotsizing problem. International Journal of Production Research, 38(14), 3421\u20133424.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"197_CR15","first-page":"173","volume":"31","author":"C. R. Sox","year":"1999","unstructured":"Sox, C. R., & Gao, Y. (1999). The capacitated lot sizing problem with setup carry-over. IIE Transactions, 31(2), 173\u2013181.","journal-title":"IIE Transactions"},{"issue":"2","key":"197_CR16","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1016\/j.ejor.2005.03.033","volume":"174","author":"C. Suerie","year":"2006","unstructured":"Suerie, C. (2006). Modeling of period overlapping setup times. European Journal of Operational Research, 174(2), 874\u2013886.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"197_CR17","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C. Suerie","year":"2003","unstructured":"Suerie, C., & Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot sizes. Management Science, 49(8), 1039\u20131054.","journal-title":"Management Science"},{"key":"197_CR18","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.compchemeng.2007.05.001","volume":"32","author":"C. Sung","year":"2008","unstructured":"Sung, C., & Maravelias, C. T. (2008). A mixed-integer programming formulation for the general capacitated lot-sizing problem. Computers & Chemical Engineering, 32, 244\u2013259.","journal-title":"Computers & Chemical Engineering"},{"issue":"2","key":"197_CR19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1590\/S0104-530X2005000200006","volume":"12","author":"E. A. V. Toso","year":"2005","unstructured":"Toso, E. A. V., & Morabito, R. (2005). Otimiza\u00e7\u00e3o no dimensionamento e\u00a0seq\u00fcenciamento de\u00a0lotes de\u00a0produ\u00e7\u00e3o: Estudo de caso numa f\u00e1brica de ra\u00e7\u00f5es. Gest\u00e3o e Produ\u00e7\u00e3o, 12(2), 203\u2013217.","journal-title":"Gest\u00e3o e Produ\u00e7\u00e3o"},{"issue":"12","key":"197_CR20","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1287\/mnsc.48.12.1587.442","volume":"48","author":"L. Wolsey","year":"2002","unstructured":"Wolsey, L. (2002). Solving multi-item lot-sizing problems with an mip solver using classification and reformulation. Management Science, 48(12), 1587\u20131602.","journal-title":"Management Science"},{"issue":"11","key":"197_CR21","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408170600559706","volume":"38","author":"X. Y. Zhu","year":"2006","unstructured":"Zhu, X. Y., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Transactions, 38(11), 987\u20131007.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0197-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0197-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0197-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:36:44Z","timestamp":1559677004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0197-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["197"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0197-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,16]]}}}