Flexible job shop scheduling using genetic algorithm and heuristic rules
Job shop scheduling with the availability of more than one machine to perform an operation, also known as the flexible job shop scheduling problem, is computationally NP-hard. An efficient scheduling method is proposed here, using a genetic algorithm that incorporates heuristic rules. The scheduler&...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
The Japan Society of Mechanical Engineers
2016-02-01
|
| Seri Bilgileri: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Konular: | |
| Online Erişim: | https://www.jstage.jst.go.jp/article/jamdsm/10/1/10_2016jamdsm0010/_pdf/-char/en |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|