Scheduling;
Parallel machines;
Early work;
Late work;
Polynomial time approximation scheme;
90B35;
68Q25;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NP-hard. We prove a few dominance properties of optimal solutions of this problem. Their proposal was inspired by the results of some auxiliary computational experiments. Test were performed with the dynamic programming algorithm and list algorithms. Then, we propose the polynomial time approximation scheme, based on structuring problem input. Moreover, we discuss the relationship between the early work criterion and the related late work criterion. We compare the computational complexity and approximability of scheduling problems with both mentioned objective functions.
机构:
Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong, Peoples R China
Xiao, WG
Li, CL
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong, Peoples R China