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

Zhang Xingong and Wang Yong

Mathematical Problems in Engineering, 2013, vol. 2013, 1-7

Abstract:

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/138240.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/138240.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:138240

DOI: 10.1155/2013/138240

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().