A Genetic Algorithm of Non-permutation Flow Shop Manufacturing Cell Scheduling with Sequence Dependent Setups
碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === This research is concerned with the scheduling of a non-permutation flowline manufacturing cell with sequence-dependent family setup times. We develop a new chromosome representation scheme. Based on the new representation and a prior one, two genetic algorithm...
Main Authors: | Hung, Hau-Han, 洪浩翰 |
---|---|
Other Authors: | Wu, Muh-Cherng |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27064697021250858626 |
Similar Items
-
Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
by: Jabrane Belabid, et al.
Published: (2020-01-01) -
Relax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
Published: (2010-09-01) -
The Multiple-Objective Scheduling in Flow Shop Scheduling with Sequence Dependent Setup Times
by: Shihkai Lin, et al.
Published: (2003) -
An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time
by: Farahmand-Mehr Mohammad, et al.
Published: (2014-01-01) -
Hybrid Flow Shop Scheduling with Unrelated Parallel Machines and Sequence-dependent Setup Time
by: Shao-Hao Chang, et al.
Published: (2018)