Makespan Minimization for Two Parallel Machines Scheduling with A Periodic Availability Constraint: The Preemptive Offline Version

摘要：

We consider the preemptive offline version of the problem two parallel machines scheduling where one machine is periodically unavailable with nonpreemptive jobs and the objective of minimizing the makespan. We propose a polynomial algorithm with tune complexity O(n log n) based on the well-known McNaughtons Wrap-Around rule for the considered problem.

关键词： scheduling maintenance makespan parallel machine

作者: Dehua Xu Meng Qu

作者单位: School of Mathematics and Information Sciences East China Institute of Technology Fuzhou,Jiangxi 344 School of Mathematics and Computer Sciences Anhui Normal University Wuhu,Anhui 241002,China

会议类型: 国际会议

会议名称: The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

会议地点: 黄山

会议语种:英文

页码: 177-181

在线出版日期: 2010-05-28（万方平台首次上网日期，不代表论文的发表时间）