Using job-based chromosomes with 1-tuple genes to develop meta-heuristic algorithms for DFJSP scheduling subject to maintenance
碩士 === 國立交通大學 === 工業工程與管理系所 === 101 === This thesis aims at solve the problem of distributed flexible job-shop subject to preventive maintenance (i.e., the DFJSP/PM problem). This scheduling problem is NP-hard, which contains four sub-decisions: (1) job-to-cell assignment, (2) operation-to-machine,...
Main Authors: | Chang, Mu-Hsuan, 張慕萱 |
---|---|
Other Authors: | Wu, Muh-Cherng |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72106621164227574347 |
Similar Items
-
Using Job-Based Chromosome with 2-tuple Genes to Develop Meta-heuristic Algorithms for DFJSP Scheduling Subject to Maintenance
by: Ho, Nien-Wei, et al.
Published: (2013) -
Using OP-Based Chromosomes with 1-tuple Genes to Develop Meta-heuristic Algorithms for DFJSP Scheduling Subject to Maintenance
by: Fan, Yung-Ting, et al.
Published: (2013) -
Using OP-Based Chromosomes with 2-tuple Genes to Develop Meta-heuristic Algorithms for DFJSP Scheduling Subject to Maintenance
by: Lee, I-Ling, et al.
Published: (2013) -
Using OP-Based Chromosomes with Maintenance Assignment Heuristics to Develop Meta-heuristic Algorithms for DFJSP Scheduling
by: Kuo, Chun-Yi, et al.
Published: (2013) -
A Comparison of Meta-heuristics Algorithms for Job Shop Scheduling Problem
by: Kuang-Pei Lu, et al.
Published: (2007)