Mspt2 Heuristic And Dynamic Programming Method For The Parallel Machine Scheduling Problem With Scheduled Preventive Maintenance
2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS(2006)
摘要
In this paper, we consider the parallel-machine scheduling problem with scheduled maintenance periods to minimize the total (non-weighted and weighted) completion time. For the case of single maintenance period on each machine, we provide an adapted definition of the "SPT" algorithm and we propose an MSPT2 heuristic. For the general case, we present a dynamic programming model to solve optimally the problem. In addition, improved dominance properties are proposed. Experimental simulations are done to evaluate the method performances.
更多查看译文
关键词
scheduling problem, availability constraint, parallel machines, total completion time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要