Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption |
scientific article |
Statements
Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (English)
0 references
13 October 2014
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references