Job Shop Scheduling Problems with Alternative Routings using Variable Neighbourhood Descent to Minimize Makespan
This paper deals with a generalization of the classical job shop scheduling problem known as the flexible job shop sheduling problem (FJSP). A heuristic algorithm based on variable neighbourhood descent (VND) is put forward to tackle the problem such that the maximum completion time (makespan) of the schdule is minimised. The performance of this VND based approach is assessed using well known data sets from the literature. Some preliminary results are reported and very competitive results are also abtained when compared to the best known results from the literature.
Di buat oleh: Arif Imran (arifimran@itenas.ac.id / arifimr@yahoo.com), Martino Luis (luis@itenas.ac.id), Emsosfi Zaini (efi@itenas.ac.id), B. Beny (bny_511@yahoo.com).
Kata kunci : job shop, alternative routings, heuristics, makespan
Keterangan : Proceeding The International Conference on Industrial Engineering and Business Management 2010, Universitas Islam Negeri Sunan Kalijaga, ISBN : 978-602-97809-0-1.