Abstract
In many industries mixed-model assembly systems are increasingly supplied out of third-party consignment stock. This novel trend gives rise to a new short-term sequencing problem which decides on the succession of models launched down the line and aims at minimizing the cost of in-process inventory held by the manufacturer. In this work, we investigate the mathematical structure of this part oriented mixed-model sequencing problem and prove that general instances of the problem are NP-hard in the strong sense. Moreover, we develop a new Beam Search heuristic, which clearly outperforms existing solution procedures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blum, C. (2005). Beam-ACO–Hybridizing ant colony optimization with beam serach: An application to open shop scheduling. Computers & Operations Research, 32, 1565–1591.
Boysen, N., Fliedner, M., & Scholl, A. (2008). Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectrum, 30, 509–528.
Boysen, N., Fliedner, M., & Scholl, A. (2009a). Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, 192, 349–373.
Boysen, N., Fliedner, M., & Scholl, A. (2009b). Level scheduling of mixed-model assembly lines under storage constraints. International Journal of Production Research, 47, 2669–2684.
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–115.
Gagné, C., Gravel, M., & Price, W. L. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174, 1427–1448.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
Kubiak, W. (1993). Minimizing variation of production rates in just-in-time systems: A survey. European Journal of Operational Research, 66, 259–271.
Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis. Carnegie-Mellon University, USA, April.
Monden, Y. (1998). Toyota production system: an integrated approach to just-in-time, 3rd edn. Norcross: Engineering and Management Press.
Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 297–307.
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–42.
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–930.
Thomopoulos, N. T. (1967). Line balancing-sequencing for mixed-model assembly. Management Science, 14, 59–75.
Tsai, L.-H. (1995). Mixed-model sequencing to minimize utility work and the risk of conveyor stoppage. Management Science, 41, 485–495.
Wang, F., & Lim, A. (2007). A stochastic beam search for the berth allocation problem. Decision Support Systems, 42, 2186–2196.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fliedner, M., Boysen, N. & Scholl, A. On the part inventory model sequencing problem: complexity and Beam Search heuristic. J Sched 14, 17–25 (2011). https://doi.org/10.1007/s10951-010-0214-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0214-9