A Generalized MILP Formulation for the Period-Aggregated Resource Leveling Problem with Variable Job Duration - Archive ouverte HAL Access content directly
Journal Articles Algorithms Year : 2020

A Generalized MILP Formulation for the Period-Aggregated Resource Leveling Problem with Variable Job Duration

Abstract

We study a resource leveling problem with variable job duration. The considered problem includes both scheduling and resource management decisions. The planning horizon is fixed and separated into a set of time periods of equal length. There are several types of resources and their amount varies from one period to another. There is a set of jobs. For each job, a fixed volume of work has to be completed without any preemption while using different resources. If necessary, extra resources can be used at additional costs during each time period. The optimization goal is to minimize the total overload costs required for the execution of all jobs by the given deadline. The decision variables specify the starting time of each job, the duration of the job and the resource amount assigned to the job during each period (it may vary over periods). We propose a new generalized mathematical formulation for this optimization problem. The formulation is compared with existing approaches from the literature. Theoretical study and computational experiments show that our approach provides more flexible resource allocation resulting in better final solutions.
Fichier principal
Vignette du fichier
Tarasov_26947.pdf (407.74 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03046513 , version 1 (08-12-2020)

Identifiers

Cite

Ilia Tarasov, Alain Haït, Olga Battaïa. A Generalized MILP Formulation for the Period-Aggregated Resource Leveling Problem with Variable Job Duration. Algorithms, 2020, 13 (1), pp.6-21. ⟨10.3390/a13010006⟩. ⟨hal-03046513⟩

Collections

KEDGE-BS
16 View
107 Download

Altmetric

Share

Gmail Facebook X LinkedIn More