Anda belum login :: 30 Mar 2023 09:19 WIB
A Novel Genetic Algorithm to Solve DFJSP Scheduling Problems
Article from Proceeding
The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines
Distributed Flexible Job Shop
Solution Representation Scheme.
This research studies a distributed and flexible job shops scheduling problem (DFJSP). The DFJSP involves three sub-decisions: (1) job-to-cell assignment, (2) operation-to-machine assignment, (3) operation sequencing on a machine. To solve the DFJSP by meta-heuristic algorithms, we propose a new solution representation scheme (called Snew), which models the operations of all jobs to be scheduled by a sequence. Based on Snew, this research develops a genetic algorithm (called GA_Snew) to solve the DFJSP. Experiments indicate that GA_Snew outperform the state-of-the-art work (called GA_Sold), which is a genetic algorithm based on a traditional solution representation scheme.
Klik untuk menuliskan opini Anda tentang koleksi ini!
Copyright © 2006, 2007
Unika Atma Jaya
, all rights reserved
Process time: 0.015625 second(s)