Lot scheduling with multiple process routes in job shop

This paper presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment. In the genetic algorithms novel encoding scheme was proposed, which can optimize lot streaming by determining the number of sub-lots and the sub-lot processing order simultaneously. The objective of scheduling problems was to minimize makespan. The genetic algorithm combining with dispatching rules was used. After using crossover and mutation operations, a best or second best scheduling plan can be found. Computer simulation was conducted, and the simulation results are given and show the algorithm is feasible.