Scheduling Uniform Parallel Machines with Machine Eligibility Restrictions to Minimize Total Weighted Tardiness
This paper considers the problem of scheduling uniform parallel machines with machine eligibility restrictions to minimize total weighted tardiness. We presented a new heuristic algorithm based local search on each machine for this problem. The experimental results have shown that the proposed heuristic was a very effective method for this problem in terms of solution quality, computational expense, coding complexity and algorithm stability, as seen through a comparison of 6 algorithms on various pairs of test data. Moreover, we observed that the proposed algorithm can be extended to the unrelated parallel machine setting.
scheduling uniform parallel machine total weighted tardiness machine eligibility heuristic
Ying Guo Xinbao Liu
School of Management, Hefei University of Technology, Hefei, Anhui Province, People Republic of China
国际会议
太原
英文
165-168
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）