Parallel machine scheduling with flexible maintenance activities for minimizing total completion time
碩士 === 國立中央大學 === 工業管理研究所 === 101 === In this paper we consider the problem of scheduling n non-preemptive jobs on m identical machines with flexible maintenance activities, and the objective is to minimize total completion time of jobs. In the past, the majority of scheduling studies assumes that m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06873308399407029346 |