{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:07:27Z","timestamp":1760710047589,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T00:00:00Z","timestamp":1573603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T00:00:00Z","timestamp":1573603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"crossref","award":["MOST 106-2221-E-009-114- MY2"],"award-info":[{"award-number":["MOST 106-2221-E-009-114- MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 108-2221-E-009-029 -"],"award-info":[{"award-number":["MOST 108-2221-E-009-029 -"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10479-019-03462-1","type":"journal-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T14:02:41Z","timestamp":1573653761000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups"],"prefix":"10.1007","volume":"311","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4648-6133","authenticated-orcid":false,"given":"Sheng-I","family":"Chen","sequence":"first","affiliation":[]},{"given":"Delvinia","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,13]]},"reference":[{"issue":"1\u20134","key":"3462_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00170-013-5252-y","volume":"70","author":"M Babaei","year":"2014","unstructured":"Babaei, M., Mohammadi, M., & Fatemi Ghomia, S. M. T. (2014). A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. The International Journal of Advanced Manufacturing Technology, 70(1\u20134), 125\u2013134.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"5","key":"3462_CR2","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1287\/opre.33.5.989","volume":"33","author":"JR Birge","year":"1985","unstructured":"Birge, J. R. (1985). Decomposition and partitioning methods for multistage stochastic linear programs. Operations Research, 33(5), 989\u20131007.","journal-title":"Operations Research"},{"key":"3462_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge, J. R., & Louveaux, F. (2011). Introduction to stochastic programming. Berlin: Springer."},{"issue":"15","key":"3462_CR4","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1080\/00207540500435116","volume":"44","author":"P Brandimarte","year":"2006","unstructured":"Brandimarte, P. (2006). Multi-item capacitated lot-sizing with demand uncertainty. International Journal of Production Research, 44(15), 2997\u20133022.","journal-title":"International Journal of Production Research"},{"issue":"8","key":"3462_CR5","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1080\/00207543.2014.885662","volume":"52","author":"A Clark","year":"2014","unstructured":"Clark, A., Mahdieh, M., & Rangel, S. (2014). Production lot sizing and scheduling with non-triangular sequence-dependent setup times. International Journal of Production Research, 52(8), 2490\u20132503.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"3462_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2017","unstructured":"Copil, K., W\u00f6rbelauer, M., Meyr, H., & Tempelmeier, H. (2017). Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectrum, 39(1), 1\u201364.","journal-title":"OR Spectrum"},{"issue":"6","key":"3462_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02025089","volume":"43","author":"LF Escudero","year":"1993","unstructured":"Escudero, L. F., Kamesam, P. V., King, A. J., & Wets, R. J.-B. (1993). Production planning via scenario modelling. Annals of Operations Research, 43(6), 309\u2013335.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3462_CR8","doi-asserted-by":"publisher","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 Spectrum, 19(1), 11\u201321.","journal-title":"OR Spectrum"},{"issue":"3","key":"3462_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ejor.2014.05.018","volume":"239","author":"L Guimar\u00e3es","year":"2014","unstructured":"Guimar\u00e3es, L., Klabjan, D., & Almada-Lobo, B. (2014). Modeling lotsizing and scheduling problems with sequence dependent setups. European Journal of Operational Research, 239(3), 644\u2013662.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3462_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.cor.2003.08.014","volume":"32","author":"D Gupta","year":"2005","unstructured":"Gupta, D., & Magnusson, T. (2005). The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32(4), 727\u2013747.","journal-title":"Computers & Operations Research"},{"key":"3462_CR11","doi-asserted-by":"publisher","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 Spectrum, 18, 51\u201359.","journal-title":"OR Spectrum"},{"key":"3462_CR12","volume-title":"Lecture notes in economics and mathematical systems","author":"K Haase","year":"2012","unstructured":"Haase, K. (2012). Lecture notes in economics and mathematical systems. Berlin: Springer."},{"issue":"7","key":"3462_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1080\/00207548908942611","volume":"27","author":"CJ Ho","year":"1989","unstructured":"Ho, C. J. (1989). Evaluating the impact of operating environments on MRP system nervousness. The International Journal of Production Research, 27(7), 1115\u20131135.","journal-title":"The International Journal of Production Research"},{"key":"3462_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ijpe.2016.07.027","volume":"180","author":"Z Hu","year":"2016","unstructured":"Hu, Z., & Hu, G. (2016). A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty. International Journal of Production Economics, 180, 198\u2013207.","journal-title":"International Journal of Production Economics"},{"issue":"5","key":"3462_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi, B., Fatemi Ghomia, S. M. T., & Wilson, J. M. (2003). The capacitated lot sizing problem: A review of models and algorithms. Omega, 31(5), 365\u2013378.","journal-title":"Omega"},{"key":"3462_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","volume":"204","author":"K Lee","year":"2013","unstructured":"Lee, K., Leung, J. Y., & Pinedo, M. L. (2013). Makespan minimization in online scheduling with machine eligibility. Annals of Operations Research, 204, 189\u2013222.","journal-title":"Annals of Operations Research"},{"key":"3462_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cie.2017.07.014","volume":"111","author":"Y Li","year":"2017","unstructured":"Li, Y., & Hu, G. (2017). Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency. Computers & Industrial Engineering, 111, 263\u2013271.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"3462_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.6.2.197","volume":"6","author":"A Madansky","year":"1960","unstructured":"Madansky, A. (1960). Inequalities for stochastic linear programming problems. Management Science, 6(2), 197\u2013204.","journal-title":"Management Science"},{"issue":"4","key":"3462_CR20","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7(4), 326\u2013329.","journal-title":"Journal of the ACM"},{"issue":"7","key":"3462_CR21","doi-asserted-by":"publisher","first-page":"5134","DOI":"10.1016\/j.apm.2012.10.024","volume":"37","author":"R Ramezanian","year":"2013","unstructured":"Ramezanian, R., & Saidi-Mehrabad, M. (2013). Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system. Applied Mathematical Modelling, 37(7), 5134\u20135147.","journal-title":"Applied Mathematical Modelling"},{"key":"3462_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R. T., & Wets, R. J.-B. (1991). Scenario and policy aggregation in optimization under uncertainty. Mathematics of Operations Research, 16, 119\u2013147.","journal-title":"Mathematics of Operations Research"},{"key":"3462_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming: modeling and theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., & Ruszczy\u0144ski, A. (2009). Lectures on stochastic programming: modeling and theory. Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"3462_CR24","doi-asserted-by":"publisher","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, 874\u2013886.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3462_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/ijoc.1080.0282","volume":"21","author":"C Valente","year":"2009","unstructured":"Valente, C., Mitra, G., Sadki, M., & Fourer, R. (2009). Extending algebraic modelling languages for stochastic programming. INFORMS Journal on Computing, 21(1), 107\u2013122.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"3462_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S0377-2217(97)89646-4","volume":"99","author":"LA Wolsey","year":"1997","unstructured":"Wolsey, L. A. (1997). MIP modelling of changeovers in production planning and scheduling problems. European Journal of Operational Research, 99(1), 154\u2013165.","journal-title":"European Journal of Operational Research"},{"key":"3462_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2015.04.010","volume":"63","author":"J Xiao","year":"2015","unstructured":"Xiao, J., Yang, H., Zhang, C., Zheng, L., & Gupta, J. N. (2015). A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Computers & Operations Research, 63, 72\u201382.","journal-title":"Computers & Operations Research"},{"issue":"16","key":"3462_CR28","doi-asserted-by":"publisher","first-page":"5011","DOI":"10.1080\/00207543.2013.790570","volume":"51","author":"J Xiao","year":"2013","unstructured":"Xiao, J., Zhang, C., Zheng, L., & Gupta, J. N. (2013). MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. International Journal of Production Research, 51(16), 5011\u20135028.","journal-title":"International Journal of Production Research"},{"issue":"16","key":"3462_CR29","doi-asserted-by":"publisher","first-page":"4701","DOI":"10.1080\/00207540903055727","volume":"48","author":"MK Zanjani","year":"2010","unstructured":"Zanjani, M. K., Nourelfath, M., & Ait-Kadi, D. (2010). A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand. International Journal of Production Research, 48(16), 4701\u20134723.","journal-title":"International Journal of Production Research"},{"issue":"7","key":"3462_CR30","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1080\/00207541003690074","volume":"49","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Prajapati, M., & Peden, E. (2011). A stochastic production planning model under uncertain seasonal demand and market growth. International Journal of Production Research, 49(7), 1957\u20131975.","journal-title":"International Journal of Production Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03462-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-019-03462-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03462-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T12:31:39Z","timestamp":1647001899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-019-03462-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,13]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3462"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03462-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,11,13]]},"assertion":[{"value":"13 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}