Minimize the total completion times on parallel machines subject to both machine eligibilities resource constraints
碩士 === 中原大學 === 工業與系統工程研究所 === 105 === This study considers the identical parallel machine scheduling problem with arrival times, machine eligibility and resource constraints. Machine eligibility means that not all machines can process all jobs. Each job requires resource. There is upper limit on ea...
Main Authors: | Zhi-Xiang Cai, 蔡誌翔 |
---|---|
Other Authors: | Ling-Huey Su |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22105CYCU5030058%22.&searchmode=basic |
Similar Items
-
Minimize the total weighted completion time on parallel machines subject to machine and chamber eligibilities
by: Yu-An Tu, et al.
Published: (2018) -
Scheduling on identical parallel machines to minimize total completion time with deadline constraint and machine eligibility
by: Cheng-Chao Lin, et al.
Published: (2007) -
Preemptive Parallel Machine Scheduling with Machine Availability and Eligibility Constraints to Minimize Total Completion Time
by: Ko-hsuan Pao, et al.
Published: (2015) -
Identical Parallel Machine Scheduling with Machine Availability and Eligibility Constraints to Minimize Total Completion Time
by: Yu-Cyuan Chen, et al.
Published: (2016) -
Minimizing the total completion time of parallel machines with machine and chamber eligibilities
by: SSU-MIN CHANG, et al.
Published: (2018)