Makespan minimization for unrelated parallel machine problem with sequence dependent setup times
碩士 === 國立臺灣科技大學 === 工業管理系 === 97 === This thesis focuses on an unrelated parallel machine scheduling problem with sequence dependent setup times. The objective of the problem is to minimize the makespan. Due to the complexity of the problem, finding optimal solutions for large problems is very diffi...
Main Authors: | Guo-You Huang, 黃國祐 |
---|---|
Other Authors: | Ching-Jong Liao |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87602826212742924334 |
Similar Items
-
A Hybrid Algorithm for Minimizing Makespan for Sequence-Dependent Family Setup time Scheduling Problem on Unrelated Parallel Machines
by: Shu-ting Li, et al.
Published: (2016) -
Unrelated parallel machine scheduling problem with sequence dependent setup times
by: Pei Hsuan Lin, et al.
Published: (2013) -
Scheduling on unrelated parallel machines with sequence dependent setup times
by: Guilherme Etcheverry, et al.
Published: (2014-08-01) -
Minimizing Makespan for Scheduling Problem on Unrelated Parallel Machines by Using Particle Swarm Optimization
by: Chang Han, et al.
Published: (2016) -
Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines
by: Page, Daniel
Published: (2014)