Abstract
We consider single-machine scheduling with a common due-window and a deteriorating rate-modifying activity. We assume that the processing time of a job is a function of the amount of a resource allocated to it, its position in the processing sequence, and its aging effect. The objective is to minimize the total cost, which is a function of earliness, tardiness, due-window starting time, due-window size, and resource consumption. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also give a more efficient solution algorithm for a special case of the second problem.
Original language | English |
---|---|
Pages (from-to) | 952-961 |
Number of pages | 10 |
Journal | Computers and Industrial Engineering |
Volume | 66 |
Issue number | 4 |
DOIs | |
Publication status | Published - 29 Nov 2013 |
Keywords
- Aging effect
- Deteriorating rate-modifying activity
- Due-window assignment
- Resource allocation
- Scheduling
ASJC Scopus subject areas
- General Computer Science
- General Engineering