Abstract
This paper considers a two-stage robotic flow shop scheduling problem of which the objective is to minimize the maximum completion time of all the jobs. The problem consists of two dedicated machines at the first stage and a single machine at the second stage. Each job is defined by two operations processed in series on two stages. Depending on the job type, each job is processed on a dedicated machine at the first stage, and is then transported, by a robot or a conveyor, to be processed on a single machine at the second stage. To tackle the problem, a mixed integer programming model is proposed, which is solved by CPLEX. This model is improved using valid inequalities based on three lower bounds. In addition, we establish the complexity of several variations of the problem and we identify special cases that can be solved in polynomial time. Furthermore due to the NP-hardness of the problem, two heuristics are proposed to solve approximately large-sized problems. The results indicate that the solutions obtained are of high quality and the corresponding CPU time is acceptable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahmadizar F, Shahmaleki P (2014) Group shop scheduling with sequence-dependent setup and transportation times. Appl Math Model 38(21):5080–5091
Behnamian J, Fatemi Ghomi S, Jolai F, Amirtaheri O (2012) Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. Appl Math Model 36(2):723–735
Centeno G, Armacost RL (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int J Prod Res 42(6):1243–1256
Chikhi N, Abbas M, Bekrar A, Benmansour R, Hanafi S (2014) On the complexity of robotic flow shop with transportation constraints. In: ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision, Bordeaux, France
Elmi A, Topaloglu S (2013) A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Comput Oper Res 40(10):2543–2555
Graham RL, Lawler EL, Lenstra JK, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Gupta JN (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359–364
Hurink J, Knust S (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl Math 112(1):199–216
Hwang H-C, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31(12):2055–2061
Kise H (1991) On an automated two-machine flowshop scheduling problem with infinite buffer. J Oper Res Soc Japan 34(3):354–361
Lee CY, Chen ZL (2001) Machine scheduling with transportation considerations. J Sched 4(3):24
Levner E, Kogan K, Levin I (1995) Scheduling a two-machine robotic cell: a solvable case. Ann Oper Res 57(1):217–232
Lin BM (1999) The strong np-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput Oper Res 26(7):695–698
Maggu PL, Das G, Kumar R (1981) On equivalent-job for job-block in 2\(\times \) n sequencing problem with transportation-times. J Oper Res Soc Japan 24(2):136–146
Oĝuz C, Lin BM, Edwin Cheng T (1997) Two-stage flowshop scheduling with a common second-stage machine. Computers & Operations Research 24(12):1169–1174
Panwalkar S (1991) Scheduling of a two-machine flowshop with travel time between machines. J Oper Res Soc 42(7):609–613
Riane F, Artiba A, Elmaghraby SE (2002) Sequencing a hybrid two-stage flowshop with dedicated machines. Int J Prod Res 40(17):4353–4380
Tang L, Liu P (2009) Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration. Appl Math Model 33(2):1187–1199
Wang S, Liu M (2013) A heuristic method for two-stage hybrid flow shop with dedicated machines. Comput Oper Res 40(1):438–450
Yang J (2013) A two-stage hybrid flow shop with dedicated machines at the first stage. Comput Oper Res 40(12):2836–2843
Yao FS, Zhao M, Zhang H (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Comput Oper Res 39(7):1701–1712
Zhong W-Y, Lv L-H (2014) Hybrid flowshop scheduling with interstage job transportation. J Oper Res Soc China 2(1):109–121
Zhu H (2012) A two stage scheduling with transportation and batching. Inf Process Lett 112(19):728–731
Acknowledgments
The authors would like to thank the two anonymous reviewers for their constructive comments and for their helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chikhi, N., Abbas, M., Benmansour, R. et al. A two-stage flow shop scheduling problem with transportation considerations. 4OR-Q J Oper Res 13, 381–402 (2015). https://doi.org/10.1007/s10288-015-0297-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-015-0297-4