{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T06:23:48Z","timestamp":1743488628953},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T00:00:00Z","timestamp":1291939200000},"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,2]]},"DOI":"10.1007\/s10951-010-0214-9","type":"journal-article","created":{"date-parts":[[2010,12,9]],"date-time":"2010-12-09T17:45:33Z","timestamp":1291916733000},"page":"17-25","source":"Crossref","is-referenced-by-count":9,"title":["On the part inventory model sequencing problem: complexity and Beam Search heuristic"],"prefix":"10.1007","volume":"14","author":[{"given":"Malte","family":"Fliedner","sequence":"first","affiliation":[]},{"given":"Nils","family":"Boysen","sequence":"additional","affiliation":[]},{"given":"Armin","family":"Scholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,10]]},"reference":[{"key":"214_CR1","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C. (2005). Beam-ACO\u2013Hybridizing ant colony optimization with beam serach: An application to open shop scheduling. Computers & Operations Research, 32, 1565\u20131591.","journal-title":"Computers & Operations Research"},{"key":"214_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00291-007-0095-2","volume":"30","author":"N. Boysen","year":"2008","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2008). Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectrum, 30, 509\u2013528.","journal-title":"OR Spectrum"},{"key":"214_CR3","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. (2009a). Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, 192, 349\u2013373.","journal-title":"European Journal of Operational Research"},{"key":"214_CR4","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1080\/00207540701725067","volume":"47","author":"N. Boysen","year":"2009","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009b). Level scheduling of mixed-model assembly lines under storage constraints. International Journal of Production Research, 47, 2669\u20132684.","journal-title":"International Journal of Production Research"},{"key":"214_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/00207549308956715","volume":"31","author":"A. Cakir","year":"1993","unstructured":"Cakir, A., & Inman, R. R. (1993). Modified goal chasing for products with non-zero\/one bills of material. International Journal of Production Research, 31, 107\u2013115.","journal-title":"International Journal of Production Research"},{"key":"214_CR6","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1016\/j.ejor.2005.02.063","volume":"174","author":"C. Gagn\u00e9","year":"2006","unstructured":"Gagn\u00e9, C., Gravel, M., & Price, W. L. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174, 1427\u20131448.","journal-title":"European Journal of Operational Research"},{"key":"214_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"214_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0377-2217(93)90215-9","volume":"66","author":"W. Kubiak","year":"1993","unstructured":"Kubiak, W. (1993). Minimizing variation of production rates in just-in-time systems: A survey. European Journal of Operational Research, 66, 259\u2013271.","journal-title":"European Journal of Operational Research"},{"key":"214_CR9","unstructured":"Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis. Carnegie-Mellon University, USA, April."},{"key":"214_CR10","volume-title":"Toyota production system: an integrated approach to just-in-time","author":"Y. Monden","year":"1998","unstructured":"Monden, Y. (1998). Toyota production system: an integrated approach to just-in-time, 3rd edn. Norcross: Engineering and Management Press.","edition":"3"},{"key":"214_CR11","first-page":"297","volume":"26","author":"P. S. Ow","year":"1988","unstructured":"Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 297\u2013307.","journal-title":"International Journal of Production Research"},{"key":"214_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00246021","volume":"2","author":"B. Parrello","year":"1986","unstructured":"Parrello, B., Kabat, W., & Wos, L. (1986). Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem. Journal of Automated Reasoning, 2, 1\u201342.","journal-title":"Journal of Automated Reasoning"},{"key":"214_CR13","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1016\/j.ejor.2007.02.024","volume":"186","author":"I. Sabuncuoglu","year":"2008","unstructured":"Sabuncuoglu, I., Gocgun, Y., & Erel, E. (2008). Backtracking and exchange of information: methods to enhance a beam search algorithm for assembly line scheduling. European Journal of Operational Research, 186, 915\u2013930.","journal-title":"European Journal of Operational Research"},{"key":"214_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/mnsc.14.2.B59","volume":"14","author":"N. T. Thomopoulos","year":"1967","unstructured":"Thomopoulos, N. T. (1967). Line balancing-sequencing for mixed-model assembly. Management Science, 14, 59\u201375.","journal-title":"Management Science"},{"key":"214_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1287\/mnsc.41.3.485","volume":"41","author":"L.-H. Tsai","year":"1995","unstructured":"Tsai, L.-H. (1995). Mixed-model sequencing to minimize utility work and the risk of conveyor stoppage. Management Science, 41, 485\u2013495.","journal-title":"Management Science"},{"key":"214_CR16","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F. Wang","year":"2007","unstructured":"Wang, F., & Lim, A. (2007). A stochastic beam search for the berth allocation problem. Decision Support Systems, 42, 2186\u20132196.","journal-title":"Decision Support Systems"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0214-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0214-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0214-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:45Z","timestamp":1559468385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0214-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0214-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,10]]}}}