Journal of the Korean Society of Industry Convergence (한국산업융합학회 논문집)
- Volume 4 Issue 3
- /
- Pages.281-287
- /
- 2001
- /
- 1226-833X(pISSN)
- /
- 2765-5415(eISSN)
Simulation for Flexibility of Flexible Job Shop Scheduling
유연 Job Shop 일정계획의 유연성에 대한 시뮬레이션
- Received : 2001.07.24
- Accepted : 2001.08.25
- Published : 2001.08.31
Abstract
Traditional job shop scheduling is supposed that machine has a fixed processing job type. But actually the machine has a highly utilization or long processing time is occurred delay. Therefore product system is difficult to respond quickly to the change of products or loads or machine failure etc. Here we use flexible job shop which is supposed that a machine has several jobs by tool change. The heuristic for the flexible job shop scheduling has to solve two problems. One is a routing problem which is determine a machine to process job. The other is sequencing problem which is determine processing sequence. The approach to solve two problems arc a hierarchical approach which is determined routing and then schedule, and a concurrence approach which is solved concurrently two problems by considering routing when it is scheduled. In this study, we simulate for flexibility efficiency fo flexible job shop scheduling with machine failure using hierarchical approach.