Abstract
We study a due-window assignment problem on a single machine. The job-dependent due-windows are obtained by the common flow allowance criterion. The scheduler has the option to perform a maintenance activity which is rate modifying, i.e., improves the processing times of the following jobs. We consider a number of versions of this setting: (i) The maintenance requires a constant time, (ii) The maintenance duration is an increasing function of its starting time (linear deterioration), and (iii) The maintenance duration is position-dependent (general deterioration). We study the standard setting of regular job processing times, and investigate also the extension to position-dependent processing times. The set of potential optimal positions for the maintenance activity is fully characterized. Consequently, the problems based on all the combinations of these settings are shown to be solved in polynomial time.
| Original language | English |
|---|---|
| Pages (from-to) | 222-230 |
| Number of pages | 9 |
| Journal | International Journal of Production Economics |
| Volume | 135 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2012 |
Bibliographical note
Funding Information:This paper was supported in part by the Recanati Fund of The School of Business Administration and the Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.
Keywords
- Due-window assignment
- Flow allowance
- Maintenance activity
- Scheduling