Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
On Permutation Representations for Scheduling Problems
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
Hi-index | 0.00 |
This study focused on the integration problem of process planning and scheduling in a job shop environment. In an effort to integrate process planning and scheduling by taking advantage of the flexibility that alternative process plans offer, we have designed a GA (Genetic Algorithm)-based scheduling method. The performance of this newly suggested GA-based method has been evaluated by comparing integrated scheduling with separated scheduling in a real company that has alternative process plans. Also, a couple of benchmark cases have been tested for performance evaluation, thus proving that the integrated scheduling shown by this research can be effectively applied to the real case.