Due Date Assignment and JIT Scheduling Problem in Blocking Hybrid Flow Shop Robotic Cells with Multiple Robots and Batch Delivery Cost
الموضوعات : مجله بین المللی ریاضیات صنعتی
J. Rezaeian
1
,
N. Derakhshan
2
,
I. Mahdavi
3
,
R. Alizadeh Foroutan
4
1 - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.
2 - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.
3 - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.
4 - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.
الکلمات المفتاحية: JIT scheduling, Robotic cells, Due date assignment, Batch delivery, Multiple robots,
ملخص المقالة :
In this paper, just-in-time scheduling problem with batch delivery and due date assignment for hybrid flow shop robotic cells is considered. A mixed integer linear programming (MILP) model is presented to determine the sequence of jobs and robot moves. Two meta-heuristic algorithms including Artificial Immune System (AIS) and Tabu Search (TS) are proposed. The results show that AIS performs well for this problem.
[1] K. Arviv, H. Stern, Y. Edan, Collaborative reinforcement learning for a two-robot job transfer flow-shop scheduling problem, International Journal of Production Research 54 (2016) 1196-1209.
[2] G. D. Batur, S. Erol, O. E. Karasan, Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells, Computers & Industrial Engineering 100 (2016) 72-87.
[3] U. Bilge, G. Ulusoy, A time window approach to simultaneous scheduling of machines and material handling system in an FMS, Operations Research 43 (1995) 1058-1070.
[4] J. Carlier, M. Haouari, M. Kharbeche, A. Moukrim, An optimization-based heuristic for the robotic cell problem, European Journal of Operational Research 202 (2010) 636-645.
[5] A. Che, V. Kats, E. Levner, An efficient bicriteria algorithm for stable robotic flow shop scheduling, European Journal of Operational Research 260 (2017) 964-971.
[6] A. Elmi, S. Topaloglu, A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots, Computers & operations research 40 (2013) 2543-2555.
[7] A. Elmi, S. Topaloglu, Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots, International Journal of Computer Integrated Manufacturing 30 (2017) 805-821.
[8] A. Elmi, S. Topaloglu, Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization, Computers & Operations Research 73 (2016) 67-83.
[9] A. Elmi, S. Topaloglu, Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot, International Journal of Computer Integrated Manufacturing 27 (2014) 1144-1159.
[10] O. Engin, A. D¨oyen, A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future generation computer systems 20 (2004) 1083-1095.
[11] H. N. Geismar, M. Dawande, C. Sriskandarajah, Robotic cells with parallel machines: Throughput maximization in constant travel-time cells, Journal of Scheduling 7 (2004) 375-395.
[12] H. N. Geismar, M. Dawande, C. Sriskandarajah, Throughput optimization in constant traveltime dual gripper robotic cells with parallel machines, Production and Operations Management 15 (2006) 311-328.
[13] J. Hurink, S. Knust, A tabu search algorithm for scheduling a single robot in a job-shop environment, Discrete applied mathematics 119 (2002) 181-203.
[14] J. Hurink, S. Knust, Makespan minimization for flow-shop problems with transportation times and a single robot, Discrete Applied Mathematics 112 (2001) 199-216.
[15] M. Kharbeche, J. Carlier, M. Haouari, A. Moukrim, Exact Method for Robotic Cell Problem, Electronic Notes in Discrete Mathematics 36 (2010) 859-866.
[16] W. Lei, H. Manier, M. A. Manier, X. Wang, A hybrid quantum evolutionary algorithm with improved decoding scheme for a robotic flow shop scheduling problem, Mathematical Problems in Engineering 11-27 (2017) 2017.
[17] E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the permutation flowshop problem, European Journal of Operational Research 91 (1996) 160-175.
[18] P. Ramezani, M. Rabiee, F. Jolai, No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach, Journal of Intelligent Manufacturing 26 (2015) 731-744.
[19] S. P. Sethi, C. Sriskandarajah, G. Sorger, J. Blazewicz, W. Kubiak, Sequencing of parts and robot moves in a robotic cell, International Journal of Flexible Manufacturing Systems 4 (1992) 331-358.
[20] D. Shabtay, Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs, International Journal of Production Economics 123 (2010) 235-242.
[21] D. Shabtay, K. Arviv, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Applied Mathematical Modelling 40 (2016) 4231-4247.
[22] D. Shabtay, G. Steiner, Two due date assignment problems in scheduling a single machine, Operations research letters 34 (2006) 683-691.
[23] A. Soukhal, P. Martineau, Resolution of a scheduling problem in a flowshop robotic cell, European Journal of Operational Research 161 (2005) 62-72.
[24] N. H. Tuong, A. Soukhal, Due dates assignment and JIT scheduling with equal-size jobs, European Journal of Operational Research 205 (2010) 280-289.
[25] X. Yu, M. Gen, Introduction to evolutionary algorithms, Springer Science & Business Media, (2010).
[26] S. S. Zabihzadeh, J. Rezaeian, Two metaheuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time, Applied Soft Computing 40 (2016) 319-330.
