Routing Policies for Flow Shop with Competing Operations
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
This paper aims to introduce the concept of competing operations in flow shop and investigate the characteristics of the flow shop scheduling problem with competing operations. While different operations have different processing orders in traditional flow shop scheduling problem, some operations can be processed in arbitrary order in practical shop floors. In other words, the processing orders of given operations are fixed in traditional flow shop scheduling problem, however, this paper considers flow shop scheduling problem where some operations have variable processing orders. Such operations are defined as competing operations in this paper, and flow shops with competing operations require additional decisions on routing policies. In this context, we aim to propose several routing policies that can be applied to flow shops with competing operations, and to evaluate their performances in dynamic environment by applying simulation technique. Simulation experiments are performed by using a simulation model for a simple flow shop wich 2 competing operations, which is built by applying a commercial 3D factory simulation software called FlexSim. The experiment results reveal that the performances of proposed routing policies are dependent on the processing times of competing operations. Especially, routing policies based on the total processing time of predecessors have shown promising performances. This implies that the routing policies in flow shops with competing operations should be carefully designed with consideration of model parameters.
Abstract
This paper aims to introduce the concept of competing operations in flow shop and investigate the characteristics of the flow shop scheduling problem with competing operations. While different operations have different processing orders in traditional flow shop scheduling problem, some operations can be processed in arbitrary order in practical shop floors. In other words, the processing orders of given operations are fixed in traditional flow shop scheduling problem, however, this paper considers flow shop scheduling problem where some operations have variable processing orders. Such operations are defined as competing operations in this paper, and flow shops with competing operations require additional decisions on routing policies. In this context, we aim to propose several routing policies that can be applied to flow shops with competing operations, and to evaluate their performances in dynamic environment by applying simulation technique. Simulation experiments are performed by using a simulation model for a simple flow shop wich 2 competing operations, which is built by applying a commercial 3D factory simulation software called FlexSim. The experiment results reveal that the performances of proposed routing policies are dependent on the processing times of competing operations. Especially, routing policies based on the total processing time of predecessors have shown promising performances. This implies that the routing policies in flow shops with competing operations should be carefully designed with consideration of model parameters.
참고문헌 (18)
- M. L. Pinedo, "Scheduling-theory, algorithms, and systems" (2016), Springer
- Sule, "Industrial Scheduling" (1997), PWS Publishing Company
- J. Branke, "Automated design of production scheduling heuristics: A review", IEEE Transactions on Evolutionary Computation, 20(1), pp.110~124 (2016)
- J. M. Framinan, "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective", Journal of the Operational Research Society, 55(12), pp.1243~1255 (2004)
- R. Ruiz, "A comprehensive review and evaluation of permutation flowshop heuristics", European Journal of Operational Research, 165(2), pp.479~494 (2005)
- Q. K. Pan, "A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime", Computers and Operations Research, 40(1), pp.117~128 (2013)
- S. Hatami, "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times", International Journal of Production Economics, 169, pp.76~88 (2015)
- T. Murata, "Genetic algorithms for flowshop scheduling problems", Computers and Industrial Engineering, 30(4), pp.1061~1071 (1996)
- J. W. Kim, "Candidate order based genetic algorithm (COGA) for constrained sequencing problems, International Journal of Industrial Engineering: Theory", Applications and Practice, 23(1), pp.1~12 (2016)
- M. Ben-Daya, "A tabu search approach for the flow shop scheduling problem", 109(1), pp.88~95 (1998)
- J. W. Kim, "Performance comparison of neighborhood structures of tabu search algorithms for sequencing problems", Advanced Science Letters, 23(10), pp.10436~10439 (2016)
- I. H. Osman, "Simulated annealing for permutation flow-shop scheduling", Omega, 17(6), pp.551~557 (1989)
- B. Liu, "An effective PSO-based memetic algorithm for flow shop shceduling, IEEE Transactions on systems", Man, and Cybernetics, Part B, 37(1), pp.18~27 (2007)
- J. S. Neufeld, "A comprehensive review of flowshop group scheduling literature", Computers and Operations Research, 70, pp.56~74 (2016)
- "FlexSim Software Products" (2018)[URL]
- M. Beaverstock, "Applied simulation –modeling and analysis using FlexSim" (2011), BookBaby
- H. Jia, "The simulation and optimization on the certain type fuel pump assembly line balance based on Flexsim", Applied Mechanics and Materials, 741, pp.850~855 (2015)
- B. S., Kumar, "Modeling and analysis of flexible manufacturing system with FlexSim", International Journal of Computational Engineering Research, 5(10), pp.1~6 (2015)