A Genetic Algorithm with Dominance Properties for Single and Unrelated Parallel Machine Scheduling with Setup Time Problems
碩士 === 元智大學 === 工業工程與管理學系 === 95 === With the changing of production types, taking setup time into consideration is getting more and more important for industrial schedulers. Therefore, in this research, we explore the single machine scheduling problem that all jobs have a common due date that has b...
Main Authors: | Shih-Min Hsiung, 熊詩敏 |
---|---|
Other Authors: | 張百棧 |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/78593060158407197234 |
Similar Items
-
Solution by Genetic Algorithm In Regard to Sequence-Dependent Setup Time for Unrelated Parallel Machines Scheduling Problems
by: Jeng-Wei Tseng, et al.
Published: (2007) -
Scheduling on unrelated parallel machines with sequence dependent setup times
by: Guilherme Etcheverry, et al.
Published: (2014-08-01) -
Scheduling unrelated parallel machines with ready times and setup times
by: Feng-Yu Hsieh, et al.
Published: (2012) -
Scheduling with multi-attribute setup times on unrelated parallel machines
by: Hsing-tzu Tsai, et al.
Published: (2013) -
Unrelated parallel machine scheduling problem with sequence dependent setup times
by: Pei Hsuan Lin, et al.
Published: (2013)