Abstract
This paper investigates an online single batch machine scheduling problem for autoclave molding in composite materials manufacturing, in which the batches of jobs to be performed are modified by the new arrival jobs. The single batch machine and jobs are represented by rectangles, and jobs can be processed as a batch if the two-dimensional constraints are fulfilled, i.e., any pair of two jobs in a batch cannot overlap each other. Preemption is not allowed. Besides, the linear setup time and family incompatibility constraints are considered. The goal is to minimize the maximum completion time of batches, the makespan. To tackle this problem, two online approaches are proposed. The first one called Greedy Exact (GE) is to reschedule all unprocessed jobs as well as the new arrival jobs by a mixed-integer programming (MIP) upon a decision point. The second is a tailored rule-based algorithm (RBA), which is devised to balance the trade-off between the waste of machine resources and machine space. Both methods are compared to an offline exact model (EM), which assumes that jobs’ release times are known before starting the production. Experimental simulations are conducted to verify the effectiveness and efficiency of proposed approaches and analyze the impact of instances’ features on schedules. Besides, the management implications are provided for decision-makers to achieve managerial implications and insights.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Acebes L, Merino A, Rodriguez A et al (2019) Model based online scheduling of concurrent and equal batch process units: sugar end industrial case study. J Process Control 80:1–14 https://doi.org/10.1016/j.jprocont.2019.05.005 , https://linkinghub.elsevier.com/retrieve/pii/S0959152418301835
Aytug H, Lawley MA, McKay K et al (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161(1):86–110 https://doi.org/10.1016/j.ejor.2003.08.027, https://linkinghub.elsevier.com/retrieve/pii/S0377221703005307
Babaee Tirkolaee E, Goli A, Weber GW (2020) Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option. IEEE Trans Fuzzy Syst 28(11):2772–2783 https://doi.org/10.1109/TFUZZ.2020.2998174, https://ieeexplore.ieee.org/document/9103073/
Christensen HI, Khan A, Pokutta S et al (2017) Approximation and online algorithms for multidimensional bin packing: a survey. Comput Sci Rev 24:63–79 https://doi.org/10.1016/j.cosrev.2016.12.001, https://linkinghub.elsevier.com/retrieve/pii/S1574013716301356
Church LK, Uzsoy R (1992) Analysis of periodic and event-driven rescheduling policies in dynamic shops. Int J Comput Integr Manuf 5(3):153–163. https://doi.org/10.1080/09511929208944524
Coppersmith D, Raghavan P (1989) Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper Res Lett 8(1):17–20 https://doi.org/10.1016/0167-6377(89)90027-8, https://linkinghub.elsevier.com/retrieve/pii/0167637789900278
da Silva NCO, Scarpin CT, Pécora JE et al (2019) Online single machine scheduling with setup times depending on the jobs sequence. Comput Ind Eng 129:251–258
Epstein L (2010) Two-dimensional online bin packing with rotation. Theor Comput Sci 411(31–33):2899–2911 https://doi.org/10.1016/j.tcs.2010.04.021, https://linkinghub.elsevier.com/retrieve/pii/S0304397510002161
Fang Y, Lu X (2016) Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine. Inf Process Lett 116(8):526–531 https://doi.org/10.1016/j.ipl.2016.03.010, https://linkinghub.elsevier.com/retrieve/pii/S0020019016300345
Fang Y, Lu X, Liu P (2011) Online batch scheduling on parallel machines with delivery times. Theor Comput Sci 412(39):5333–5339 https://doi.org/10.1016/j.tcs.2011.06.011, https://linkinghub.elsevier.com/retrieve/pii/S0304397511005044
Fu R, Cheng T, Ng C et al (2013) An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper Res Lett 41(3):216–219 https://doi.org/10.1016/j.orl.2013.01.003, https://linkinghub.elsevier.com/retrieve/pii/S0167637713000047
Fu R, Tian J, Li S et al (2017) An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J Comb Optim 34(4):1187–1197. https://doi.org/10.1007/s10878-017-0139-8
Fujita S, Hada T (2002) Two-dimensional on-line bin packing problem with rotatable items. Theor Comput Sci 289(2):939–52
Hossein Nia Shavaki F, Jolai F (2021) A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers. Appl Intell 51(6):3917–3935. https://doi.org/10.1007/s10489-020-01843-9
Iori M, de Lima VL, Martello S et al (2021) Exact solution techniques for two-dimensional cutting and packing. Eur J Oper Res 289(2):399–415 https://doi.org/10.1016/j.ejor.2020.06.050, https://linkinghub.elsevier.com/retrieve/pii/S0377221720306111
Jain AK, Elmaraghy H (1997) Production scheduling/rescheduling in flexible manufacturing. Int J Prod Res 35(1):281–309. https://doi.org/10.1080/002075497196082
Li W, Li S (2015) Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs. Int J Syst Sci 46(4):652–661. https://doi.org/10.1080/00207721.2013.794904
Li D, Meng X, Liang Q et al (2015) A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines. J Intell Manuf 26(5):873–890. https://doi.org/10.1007/s10845-014-0874-y
Li W, Li S, Feng Q (2018) Online batch scheduling with kind release times and incompatible families to minimize makespan. Optim Lett 12(2):301–310. https://doi.org/10.1007/s11590-017-1113-1
Li W, Zhai W, Chai X (2019) Online Bi-criteria scheduling on batch machines with machine costs. Mathematics 7(10):960. https://doi.org/10.3390/math7100960
Ma R (2014) Online bounded-batch scheduling to minimize total weighted completion time on parallel machines. Int J Prod Econ 153:8
Mathirajan M, Sivakumar AI, Chandru V (2004) Scheduling algorithms for heterogeneous batch processors with incompatible job-families. J Intell Manuf 15(6):787–803. https://doi.org/10.1023/B:JIMS.0000042664.94495.26
Seiden SS, van Stee R (2003) New bounds for multidimensional packing. Algorithmica 36(3):261–293. https://doi.org/10.1007/s00453-003-1016-7
Shavaki FH, Jolai F (2021) Formulating and solving the integrated online order batching and delivery planning with specific due dates for orders. J Intell Fuzzy Syst 40(3):4877–4903 https://doi.org/10.3233/JIFS-201690, https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/JIFS-201690
Su B, Xie N, Yang Y (2020) Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem. J Intell Manuf. https://doi.org/10.1007/s10845-020-01597-8
Tian J, Fu R, Yuan J (2011) An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf Process Lett 111(21–22):1048–1053 https://doi.org/10.1016/j.ipl.2011.08.003, https://linkinghub.elsevier.com/retrieve/pii/S0020019011002249
Tian J, Cheng T, Ng C et al (2012) An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discret Appl Math 160(7–8):1191–1210 https://doi.org/10.1016/j.dam.2011.12.002, https://linkinghub.elsevier.com/retrieve/pii/S0166218X11004902
Tian J, Wang Q, Fu R et al (2016) Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor Comput Sci 617:65–68 https://doi.org/10.1016/j.tcs.2016.01.001, https://linkinghub.elsevier.com/retrieve/pii/S0304397516000025
Tirkolaee EB, Mahmoodkhani J, Bourani MR et al (2019) A self-learning particle swarm optimization for robust multi-echelon capacitated location-allocation-inventory problem. J Adv Manuf Syst 18(04):677–694. https://doi.org/10.1142/S0219686719500355
van Stee R (2015) SIGACT news online algorithms column 26: bin packing in multiple dimensions. ACM SIGACT News 46(2):8
Wang Q, Tian J, Fu R et al (2017) Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs. Theor Comput Sci 700:37–44 https://doi.org/10.1016/j.tcs.2017.07.022, https://linkinghub.elsevier.com/retrieve/pii/S0304397517305704
Wei L, Hu Q, Leung SC et al (2017) An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput Oper Res 80:113–127 https://doi.org/10.1016/j.cor.2016.11.024, https://linkinghub.elsevier.com/retrieve/pii/S0305054816302982
Yu Q, Yang H, Lin KY et al (2020) A self-organized approach for scheduling semiconductor manufacturing systems. J Intell Manuf. https://doi.org/10.1007/s10845-020-01678-8
Zhang J, Wang X, Huang K (2016) Integrated on-line scheduling of order batching and delivery under B2C e-commerce. Comput Ind Eng 94:280–289 https://doi.org/10.1016/j.cie.2016.02.001, https://linkinghub.elsevier.com/retrieve/pii/S0360835216300171
Acknowledgements
This work was supported by National Natural Science Foundation of China under grant 72171116, 71671090, 71871117, the Fundamental Research Funds for the Central Universities under grant NP2020022.
Author information
Authors and Affiliations
Corresponding author
Additional information
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
Zheng, S., Xie, N., Wu, Q. et al. Online single batch machine scheduling with linear setup times and incompatible jobs for autoclave molding manufacturing. J Ambient Intell Human Comput 14, 12099–12118 (2023). https://doi.org/10.1007/s12652-022-03759-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-022-03759-3