Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 138240, 7 pages
Research Article

Rescheduling Problems with Agreeable Job Parameters to Minimize the Tardiness Costs under Deterioration and Disruption

1College of Economics and Business Administration, Chongqing University, Chongqing 400030, China
2College of Mathematical Sciences, Chongqing Normal University, Chongqing 400047, China

Received 21 May 2013; Accepted 18 July 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Zhang Xingong and Wang Yong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper considers single-machine rescheduling problems with agreeable job parameters under deterioration and disruption. Deteriorating jobs mean that the processing time of a job is defined by an increasing function of its starting time. Rescheduling means that, after a set of original jobs has already been scheduled, a new set of jobs arrives and creates a disruption. We consider four cases of minimization of the total tardiness costs with agreeable job parameters under a limit of the disruptions from the original job sequence. We propose polynomial-time algorithms or some dynamic programming algorithms under sequence disruption and time disruption.