2209. Improvements to Machine Scheduling with Position-Dependent Maintenance Operations
Invited abstract in session TC-3: Maintenance Scheduling, stream Project Management and Scheduling.
Thursday, 11:45-13:15Room: H5
Authors (first author is the speaker)
| 1. | Julius Hardt
|
| 2. | Florian Jaehn
|
| Management Science and Operations Research, Helmut-Schmidt-University - University of the Federal Armed Forces Hamburg |
Abstract
We consider machine scheduling problems involving position-dependent maintenance. In these problems, a maintenance operation must be performed after at most a given number of jobs have been scheduled on the machine. Following the problem definition, we present some new theoretical insights and some improvements to existing results. The focus is on minimizing the maximum lateness in the one-machine scheduling problem, taking release dates and preemption into consideration. A new bound for the maximum number of maintenance operations required in an optimal solution is given. We obtain a deeper understanding of the need for fractional processing times in certain instances. Additionally, we propose a new MILP model incorporating new and already existing theoretical results and report on the computational study.
Keywords
- Scheduling
- Mixed-Integer Programming
Status: accepted
Back to the list of papers