Abstract
Production scheduling is an important research topic widely studied during past few decades. However, many manufacturers still fail to successfully deploy scheduling algorithms and systems, even though information and communication technologies can be used to collect and process data associated with production scheduling under modern smart manufacturing environment. The primary problem is that many scheduling algorithms and systems did not consider diverse variety of scheduling requirements of real production systems. Especially, production schedulers in small make-to-order manufacturers have much trouble in utilizing such algorithms and systems. In order to address this issue, this paper aims to propose a functional architecture of production scheduling system for small make-to-order manufactures under smart manufacturing environment and develop a flexible scheduling algorithm for this system. For illustration, the proposed system and algorithm are applied to a two-machine flow shop scheduling problem, and it is expected that this paper will provide a meaningful insight into the user experiences of production scheduling systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Radziwon A, Bilberg A, Bogers M, Madsen ES (2014) The smart factory – exploring adaptive and flexible manufacturing solutions. Procedia Engineer 69:1184–1190
Lee J (2015) Smart factory systems. Inf-Spektrum. 38:230–235
Kim S, Kim DY (2018) Efficient data-forwarding method in delay-tolerant P2P networking for IoT services. Peer-to-Peer Netw Appl. https://doi.org/10.1007/s12083-017-0614-0
Longo F, Nicolettie L, Padovano A (2017) Smart operators in industry 4.0 – a human-centered approach to enhance operators’ capabilities and competencies within the new smart factory context. Comput Ind Eng 113:144–159
Botta-Genoulaz V, Millet PA, Grabot PA (2005) A survey on the recent research literature on ERP systems. Comput Ind 56:510–522
Helo P, Suorsa M, Hao Y, Annussomnitisam P (2014) Toward a cloud-based manufacturing execution system for distributed manufacturing. Comput Ind 65:646–656
Pinedo ML (2016) Scheduling – theory, algorithms, and systems. Springer
Jacobs LW, Lauer J (1994) DSS for job shop machine scheduling. Ind Manage Data Syst 94:15–23
Bistline WG Sr, Banerjee S, Banerjee A (1998) RTSS – an interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. Comput Oper Res 25:981–995
Smed J, Johtela T, Johnsson M, Puranen M, Nevalainen O (2000) An interactive system for scheduling jobs in electronic assembly. Int J Adv Manuf Technol 16:450–459
Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140:606–617
Kim JW (2016) Candidate order based genetic algorithm (COGA) for constrained sequencing problems. Int J Ind Eng-Appl P 23:1–12
Sun Y, Zhang C, Gao L, Wang X (2011) Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. Int J Adv Manuf Technol 55:723–739
Loukil T, Teghem J, Tuyttens D (2005) Solving multi-objective production scheduling problems using metaheuristics. Eur J Oper Res 161:42–61
Nahaeinejad M, Nahavandi N (2013) An interactive algorithm for multi-objective flow shop scheduling with fuzzy processing times through resolution method and TOPSIS. Int J Adv Manuf Technol 66:1047–1064
Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem – literature review, classification and current trends. Omega. 45:119–135
Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Michigan
Glover F (1989) Tabu search – part I. ORSA J Comput 1:190–206
Glover F (1990) Tabu search – part II. ORSA J Comput 2:4–32
Chakhlevitch K, Cowling P (2008) Hyperheuristics – recent developments. In: Cotta C, Sevaux M, Sörensen K (eds) Adaptive and multilevel metaheuristics. Springer, Heidelberg, pp 3–29
Kim JW (2017) Performance comparison of neighborhood structures of tabu search algorithms for sequencing problems. Adv Sci Lett 23:10423–10439
Kim JW, Kim SK (2019) Genetic algorithms for solving shortest path problem in maze-type network with precedence constraints. Wireless Pers Commun. https://doi.org/10.1007/s11277-018-5740-3
Acknowledgements
This research was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government (Ministry of Science, ICT & Future Planning) (NRF-2017R1C1B1008650).
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is part of the Topical Collection: Special Issue on IoT System Technologies based on Quality of Experience
Guest Editors: Cho Jaeik, Naveen Chilamkurti, and SJ Wang
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kim, J.W., Kim, S.K. Interactive job sequencing system for small make-to-order manufacturers under smart manufacturing environment. Peer-to-Peer Netw. Appl. 13, 524–531 (2020). https://doi.org/10.1007/s12083-019-00808-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-019-00808-1