Author:

Keywords:

rolling horizon, scheduling

Abstract:

This paper studies the problem of scheduling malleable jobs without preemption while minimising the cost of delays and extra capacity. Jobs can either have the ascending or descending property, which means that while they are processed, the number of allocated resources are either non-decreasing or non-increasing, respectively. We propose a rolling horizon algorithm, and apply it to a line maintenance problem. Our results show that the planning process benefits from creating a robust baseline schedule.