- 期刊
- OpenAccess
An Improved Heuristic for Minimizing Total Completion Time on Single Machine with Release Time
並列摘要
This study considers the scheduling problem of minimizing the total completion time on a single machine with release dates. In view of the NP-Hard nature of the problem, one heuristic (called MM) was proposed for this problem. The proposed heuristic and two others (AEO and HR1) selected from the literature were tested on a total of 450 randomly generated single machine scheduling problems ranging from 3 to 500 jobs. Experimental results show that the proposed heuristic outperforms the AEO algorithm with respect to effectiveness and efficiency. Also, the proposed heuristic outperforms the HR1 heuristic with respect to effectiveness.
延伸閱讀
- 戚仁傑（2010）。Robust Single Machine Scheduling to Minimize Mean Tardiness〔碩士論文，國立臺北科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0006-2907201017295500
- 蔡誌翔（2017）。Minimize the total completion times on parallel machines subject to both machine eligibilities resource constraints〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu201700719
- Liu, P., & Duan, L. (2015). A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine. Discrete Dynamics in Nature and Society, 2015(), 810-813. https://doi.org/10.1155/2015/503297
- 陳信捷（2014）。Single-machine Scheduling with a Learning Effect and Fuzzy Process Time〔碩士論文，國立虎尾科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0028-2401201401522500
- （2006）。Minimizing Total Completion Time on No-Wait Two-Machine Flowshop with a Single Server〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu200600534