{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:10Z","timestamp":1759847170710},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,5,5]],"date-time":"2013-05-05T00:00:00Z","timestamp":1367712000000},"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":[[2013,10]]},"DOI":"10.1007\/s10951-013-0334-0","type":"journal-article","created":{"date-parts":[[2013,5,4]],"date-time":"2013-05-04T08:22:34Z","timestamp":1367655754000},"page":"479-494","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions"],"prefix":"10.1007","volume":"16","author":[{"given":"Stefan","family":"Bock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,5]]},"reference":[{"issue":"3","key":"334_CR1","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/j.ejor.2007.04.035","volume":"191","author":"T Benoist","year":"2008","unstructured":"Benoist, T. (2008). Soft car sequencing with colors: Lower bounds and optimality proofs. European Journal of Operational Research, 191(3), 957\u2013971.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"334_CR2","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1016\/j.ejor.2004.07.035","volume":"168","author":"S Bock","year":"2006","unstructured":"Bock, S., Rosenberg, O., & van Brackel, T. (2006). Controlling mixed-model assembly lines in real-time by using distributed systems. European Journal of Operational Research, 168(3), 880\u2013904.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"334_CR3","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/j.dam.2005.05.033","volume":"154","author":"P Bonsma","year":"2006","unstructured":"Bonsma, P., Epping, Th, & Hochst\u00e4ttler, W. (2006). Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics, 154(9), 1335\u20131343.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"334_CR4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.ejor.2007.09.013","volume":"192","author":"N Boysen","year":"2009","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009). Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, 192(2), 349\u2013373.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"334_CR5","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1287\/ijoc.1060.0205","volume":"19","author":"MG Banda De la","year":"2007","unstructured":"De la Banda, M. G., & Stuckey, P. J. (2007). Dynamic programming to minimize the maximum number of open stacks. INFORMS Journal on Computing, 19(4), 607\u2013617.","journal-title":"INFORMS Journal on Computing"},{"issue":"2\u20133","key":"334_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0166-218X(03)00442-6","volume":"136","author":"Th Epping","year":"2004","unstructured":"Epping, Th, Hochst\u00e4ttler, W., & Oertel, P. (2004). Complexity results on a paint shop problem. Discrete Applied Mathematics, 136(2\u20133), 217\u2013226.","journal-title":"Discrete Applied Mathematics"},{"key":"334_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman."},{"issue":"5","key":"334_CR8","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"PC Gilmore","year":"1964","unstructured":"Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research, 12(5), 655\u2013679.","journal-title":"Operations Research"},{"issue":"16","key":"334_CR9","doi-asserted-by":"crossref","first-page":"3831","DOI":"10.1080\/00207540310001595792","volume":"41","author":"RR Inman","year":"2003","unstructured":"Inman, R. R., & Schmeling, D. M. (2003). Algorithm for agile assembling-to-order in the automotive industry. International Journal of Production Research, 41(16), 3831\u20133848.","journal-title":"International Journal of Production Research"},{"issue":"10","key":"334_CR10","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1080\/07408170701416665","volume":"39","author":"M Lahmar","year":"2007","unstructured":"Lahmar, M., & Benjaafar, S. (2007). Sequencing with limited flexibility. IIE Transactions, 39(10), 937\u2013955.","journal-title":"IIE Transactions"},{"key":"334_CR11","doi-asserted-by":"crossref","unstructured":"Lahmar, M., Ergan, H., & Benjaafar, S. (2003). Resequencing and feature assignment on an automated assembly line. IEEE Transactions on Robotics and Automation, 19(1), 89\u2013102.","DOI":"10.1109\/TRA.2002.807556"},{"issue":"3","key":"334_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1057\/palgrave.jors.2602533","volume":"60","author":"A Lim","year":"2009","unstructured":"Lim, A., & Xu, Z. (2009). Searching optimal resequencing and feature assignment on an automated assembly line. Journal of the Operations Research Society, 60(3), 361\u2013371.","journal-title":"Journal of the Operations Research Society"},{"issue":"4","key":"334_CR13","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.dam.2008.06.017","volume":"157","author":"F Meunier","year":"2009","unstructured":"Meunier, F., & Seb\u00f6, A. (2009). Paintshop, odd cycles and necklace splitting. Discrete Applied Mathematics, 157(4), 780\u2013793.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"334_CR14","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798\u2013804.","journal-title":"Operations Research"},{"key":"334_CR15","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). Berlin: Springer.","edition":"3"},{"issue":"3","key":"334_CR16","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/j.ejor.2007.04.037","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C. (2008). Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization. European Journal of Operational Research, 191(3), 1043\u20131055.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"334_CR17","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V. D., Nguyen, A., & Artigues, C. (2008). The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research, 191(3), 912\u2013927.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"334_CR18","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1080\/00207540310001646821","volume":"42","author":"S Spieckermann","year":"2004","unstructured":"Spieckermann, S., Gutenschwager, K., & Voss, S. (2004). A sequential ordering problem in automotive paint shops. International Journal of Production Research, 42(9), 1865\u20131878.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"334_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J. N. (1992). Special cases of traveling salesman and repairman problems with time windows. Networks, 22(3), 263\u2013282.","journal-title":"Networks"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0334-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0334-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0334-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0334-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["334"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0334-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,5]]}}}