Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events

Maxence Delorme*, Manuel Iori, Nilson F.M. Mendes

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

In this work, we study the problem of scheduling jobs and maintenance activities on a set of unrelated parallel machines, by considering that the processing time of a job increases according to a deterioration factor that depends both on the machine and on the set of jobs the machine has processed since its last maintenance. The objective we consider is to minimize the makespan. We introduce four mixed integer linear programming models, two of which using big-M constraints and the other two using an exponential number of variables. We also propose an iterated local search metaheuristic to tackle large size instances and we provide empirical evidence of the performance of the proposed approaches by means of extensive computational experiments.
Original languageEnglish
Pages (from-to)823-837
JournalEuropean Journal of Operational Research
Volume295
Issue number3
DOIs
Publication statusPublished - Dec 2021

Keywords

  • Deterioration
  • Maintenance
  • Mathematical models
  • Metaheuristic
  • Scheduling

Fingerprint

Dive into the research topics of 'Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events'. Together they form a unique fingerprint.

Cite this