Approximation of a Parallel Machine Scheduling Problem with the Consideration of Preventive Maintenance, Machine Eligibility and Sequence-Dependent Setup Times to Minimize the Total Completion Time
碩士 === 國立中央大學 === 工業管理研究所 === 106 === In this research, we find the minimizing total completion time of a scheduling problem on parallel machines with consideration of machine eligibility, preventive maintenance and sequence-dependent setup times. In our problem, we have n non-preemptive jobs with t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/c9pz22 |