Scheduling equal-length jobs on uniform parallel machines
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 98 === Scheduling n identical jobs on m uniform parallel machines to minimize scheduling criteria is very common in practice. The case of identical jobs within a batch is common in manufacturing systems, where the products have identical designs or processing times...
Main Authors: | Guan-jhong Lin, 林冠仲 |
---|---|
Other Authors: | Yang-kuei Lin |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/64892507742230945241 |
Similar Items
-
Scheduling on uniform parallel machines to minimize the number of tardy jobs
by: Kun-Sian Lin, et al.
Published: (2008) -
Scheduling preemptive jobs to specific time intervals of uniform parallel machines
by: Liang, Hua-Chan, et al.
Published: (2015) -
Considering Reduced Capacity for Unrelated Parallel-Machine Scheduling Problem
by: Guan-yu Lin, et al.
Published: (2013) -
Uniform Parallel-Machine Scheduling Problems with Constrained Resources
by: Yi-Chen Wang, et al.
Published: (2008) -
Parallel Machine Scheduling with Job Splitting
by: Yeh, Shih-Lun, et al.
Published: (2009)