Abstract | This paper presents a robust genetic algorithm approach to solve job shop scheduling problems with more practical considerations. Considerations have been given not only to job processing time but also to setup time, which leads to a batch allocation for jobs. Incorporating the batch allocation into job shop scheduling promises great potential to reduce work in progress, an essential factor for production planning. The system uses genetic algorithms to evolve an appropriate permutation for dispatching rules and batch sizes with an encode-decode strategy. It then uses a non-delay heuristic algorithm to construct a feasible solution according to the permutation. Testing results show that makespan has been dramatically reduced when the batch allocation is accounted. |
---|