Approximation of Identical Parallel Machine Scheduling with Machine Availability Constraint to Minimize Total Completion Time
碩士 === 國立中央大學 === 工業管理研究所 === 106 === In this research, we discuss a scheduling problem including n non-preemptive jobs and m identical parallel machines with availability constraints. Our objective is minimizing the total completion time. . Most scheduling problems assume machines will work continu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/mp8hk5 |