首页 | 本学科首页   官方微博 | 高级检索  
     


Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
Authors:Jinjiang Yuan  Yundong Mu
Affiliation:1. Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, PR China;2. Department of Mathematics and Physics, Henan University of Technology, Zhengzhou, Henan 450052, PR China
Abstract:In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the maximum sequence disruption. We show that the considered problem can be solved in polynomial time.
Keywords:Rescheduling   Makespan   Single machine   Release dates   Disruption   NP-hard
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号