Abstract
Trial production is essential for some manufacturing systems to adjust production lines before mass production. Scheduling for trial production promotes carrying out mass production activities faster. In this paper, a set of job families with setup time should be processed on several identical parallel machines, in which jobs belonging to the same family are processed according to multitasking scheduling. The objective is to minimize the total weighted completion time. Structural properties of the investigated problem are proposed. Subsequently, a novel branch-and-price algorithm (B &P) is proposed. In detail, a label-setting algorithm is presented for fast solving the pricing problem of B &P, and the structural properties are utilized to speed up the algorithm. Computational results show that the proposed B &P has an excellent performance in both optimality and efficiency. Within the limit time of 1800 seconds, B &P is able to optimally solve 100.00% of small-size problems and 91.11% of large-size problems. The average gap of B &P in percentage between the upper bound and theoretical lower bound is close to 0.00%. Results of the final case study demonstrate that, in general, the proposed algorithm improves the efficiency of the trial production plan.
Similar content being viewed by others
Data Availability
The data that support the findings of this study are available from the website at https://github.com/jinshenggao/Applied_Intelligent_review.git.
References
Tao LY, Zhang M, Li ZD (2013) Study on the product quality control in small batch trial process. Adv Mater Res 694–697:3507–3511. https://doi.org/10.4028/www.scientific.net/AMR.694-697.3507
Shi Y, Reich D, Epelman M, Klampfl E, Cohn A (2017) An analytical approach to prototype vehicle test scheduling. Omega 67:168–176. https://doi.org/10.1016/j.omega.2016.05.003
Liu Q, Zhang H, Leng J, Chen X (2019) Digital twin-driven rapid individualised designing of automated flow-shop manufacturing system. Int J Prod Res 57(12):3903–3919. https://doi.org/10.1080/00207543.2018.1471243
Gao J, Zhu X, Bai K, Zhang R (2021) New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. Int J Prod Res 60(7):2254–2274. https://doi.org/10.1080/00207543.2021.1886368
Belabid J, Aqil S, Allali K (2022) Nash equilibrium inspired greedy search for solving flow shop scheduling problems. Applied Intelligence. https://doi.org/10.1007/s10489-022-04090-2
Siedlak DJL, Pinon OJ, Robertson BE, Mavris DN (2018) Robust simulation-based scheduling methodology to reduce the impact of manual installation tasks on low-volume aerospace production flows. J Manuf Syst 46:193–207. https://doi.org/10.1016/j.jmsy.2017.12.006
Xiong X, Zhou P, Yin Y, Cheng TCE, Li D (2019) An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Naval Research Logistics (NRL) 66(6):502–516. https://doi.org/10.1002/nav.21863
Gao J, Zhu X, Zhang R (2022) A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int Trans Oper Res 29(6):3464–3485. https://doi.org/10.1111/itor.13110
Hall NG, Leung JYT, Li C (2015) The effects of multitasking on operations scheduling. Prod Oper Manag 24(8):1248–1265. https://doi.org/10.1111/poms.12331
Hall NG, Leung JYT, Li C (2016) Multitasking via alternate and shared processing: Algorithms and complexity. Discret Appl Math 208:41–58. https://doi.org/10.1016/j.dam.2016.03.018
Salimifard K, Li J, Mohammadi D, Moghdani R (2021) A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs. Appl Intell 51(7):4143–4161. https://doi.org/10.1007/s10489-020-02027-1
Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3(1–2):59–66. https://doi.org/10.1002/nav.3800030106
Bruno J, Coffman EG, Sethi R (1974) Scheduling independent tasks to reduce mean finishing time. Commun ACM 17(7):382–387. https://doi.org/10.1145/361011.361064
Azizoglu M, Kirca O (1999) On the minimization of total weighted Flow time with identical and uniform parallel machines. Eur J Oper Res 32:91–100. https://doi.org/10.1016 &/j.cor.2004.03.013
Chen Z, Powell WB (1999) solving parallel machine scheduling problems by Column generation. INFORMS J Comput 11(1):78–94. https://doi.org/10.1287/ijoc.11.1.78
Kramer A, Dell‘Amico M (2019) Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur J Oper Res 275(1):67–79. https://doi.org/10.1016/j.ejor.2018.11.039
Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37(5):798–804. https://doi.org/10.1287/opre.37.5.798
Dunstall S, Wirth A (2005) A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur J Oper Res 167(2):283–296. https://doi.org/10.1016/j.ejor.2004.03.022
Dunstall S, Wirth A (2005) Heuristic methods for the identical parallel machine flowtime problem with set-up times. Comput Oper Res 32(9):2479–2491. https://doi.org/10.1016/j.cor.2004.03.013
Chen Z, Powell WB (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Res Logist 50(7):823–840. https://doi.org/10.1002/nav.10091
Liao C, Chao C, Chen L (2012) An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times. Comput Math Appl 63(1):110–117. https://doi.org/10.1016/j.camwa.2011.10.077
Kramer A, Iori M, Lacomme P (2021) Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization. Eur J Oper Res 289(3):825–840. https://doi.org/10.1016/j.ejor.2019.07.006
Zhu Z, Li J, Chu C (2017) Multitasking scheduling problems with deterioration effect. Math Prob Eng 2017:1–10. https://doi.org/10.1155/2017/4750791
Zhu Z, Zheng F, Chu C (2017) Multitasking scheduling problems with a rate-modifying activity. Int J Prod Res 55(1):296–312. https://doi.org/10.1080/00207543.2016.1208852
Zhu Z, Liu M, Chu C, Li J (2019) Multitasking scheduling with multiple rate-modifying activities. Int Trans Oper Res 26(5):1956–1976. https://doi.org/10.1111/itor.12393
Wang Y, Wang J, Yin Y (2020) Multitasking scheduling and due year assignment with deterioration effect and efficiency promotion. Comput Indus Eng 146:106569. https://doi.org/10.1016/j.cie.2020.106569
Ji M, Zhang W, Liao L, Cheng TCE, Tan Y (2019) Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int J Prod Res 57(6):1667–1684. https://doi.org/10.1080/00207543.2018.1497312
Yang Y, Yin G, Wang C, Yin Y (2020) Due date assignment and two-agent scheduling under multitasking environment. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-020-00600-5
Xu X, Yin G, Wang C (2021) Multitasking scheduling with batch distribution and due year assignment. Complex Intell Syst 7(1):191–202. https://doi.org/10.1007/s40747-020-00184-x
Xu C, Xu Y, Zheng F, Liu M (2021) Multitasking scheduling problems with a common due-window. RAIRO - Oper Res 55(3):1787–1798. https://doi.org/10.1051/ro/2021079
Tseng C, Lee C (2017) A new electromagnetism-like mechanism for identical parallel machine scheduling with family setup times. Int J Adv Manuf Technol 89(5):1865–1874. https://doi.org/10.1007/s00170-016-9226-8
Kayhan BM, Yildiz G (2023) Reinforcement learning applications to machine scheduling problems: a comprehensive literature review. J Intell Manuf 34(3):905–929. https://doi.org/10.1007/s10845-021-01847-3
Zhou L, Zhang L, Horn BKP (2020) Deep reinforcement learning-based dynamic scheduling in smart manufacturing. Procedia CIRP 93:383–388. https://doi.org/10.1016/j.procir.2020.05.163
Paeng B, Park I-B, Park J (2021) Deep reinforcement learning for minimizing tardiness in parallel machine scheduling with sequence dependent family setups. IEEE Access 9:101390–101401. https://doi.org/10.1109/ACCESS.2021.3097254
Goes PB, Ilk N, Lin M, Zhao JL (2018) When more is less : Field evidence on unintended consequences of multitasking. Manag Sci 64(7):3033–3054. https://doi.org/10.1287/mnsc.2017.2763
Li X, Wang L, Jiang Q (2022) Multipopulation-based multi-tasking evolutionary algorithm. Applied Intelligence. https://doi.org/10.1007/s10489-022-03626-w
Xu S, Hall NG (2021) Fatigue, personnel scheduling and operations: Review and research opportunities. Eur J Oper Res 295(3):807–822. https://doi.org/10.1016/j.ejor.2021.03.036
Liu M, Wang S, Zheng F, Chu C (2017) Algorithms for the joint multitasking scheduling and common due year assignment problem. Int J Prod Res 55(20):6052–6066. https://doi.org/10.1080/00207543.2017.1321804
Wang D, Yu Y, Yin Y, Cheng TCE (2021) Multi-agent scheduling problems under multitasking. Int J Prod Res 59(12):3633–3663. https://doi.org/10.1080/00207543.2020.1748908
Wu C, Azzouz A, Chen J, Xu J, Shen W, Lu L, Ben Said L, Lin W (2021) A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics. Complex & Intelligent Systems. https://doi.org/10.1007/s40747-021-00355-4
Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Math 5:287–326. https://doi.org/10.1016/S0167-5060(08)70356-X
Dell’Amico M, Iori M, Martello S, Monaci M (2008) Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J Comput 20(3):333–344. https://doi.org/10.1287/ijoc.1070.0246
Pritsker AAB, Waiters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: A zero-one programming approach. Manag Sci 16(1):93–108. https://doi.org/10.1287/mnsc.16.1.93
Gao J, Zhu X, Zhang R (2022) Optimization of parallel test task scheduling with constraint satisfaction. The Journal of Supercomputing. https://doi.org/10.1007/s11227-022-04943-0
Kramer HH, Uchoa E, Fampa M, Köhler V, Vanderbeck F (2016) Column generation approaches for the software clustering problem. Comput Optim Appl 64(3):843–864. https://doi.org/10.1007/s10589-015-9822-9
Acknowledgements
This work was supported by the Beijing Natural Science Foundation[grant number L201003]; the National Natural Science Foundation of China [grant number 62173025]; and the Key Research and Development Project of Guangdong Province [grant number 2021B0101420003].
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing Interests
The authors declare no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Xiaomin Zhu and Runtong Zhang contributed equally to this work.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gao, J., Zhu, X. & Zhang, R. Scheduling for trial production with a parallel machine and multitasking scheduling model. Appl Intell 53, 26907–26926 (2023). https://doi.org/10.1007/s10489-023-04845-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-023-04845-5