GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources

Juan C. Yepes-Borrero, Fulgencia Villa, Federico Perea, Juan Pablo Caballero-Villalobos

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making in realistic settings. More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. This is a more realistic extension of the traditional problem, in which the setups are assumed to be done without using additional resources (e.g. workers). We propose three metaheuristics following two approaches: a first approach that ignores the information about additional resources in the constructive phase, and a second approach that takes into account this information about the resources. Computational experiments are carried out over a benchmark of small and large instances. After the computational analysis we conclude that the second approach shows an excellent performance, overcoming the first approach.

Original languageEnglish (US)
Article number112959
JournalExpert Systems with Applications
Volume141
DOIs
StatePublished - Mar 1 2020
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources'. Together they form a unique fingerprint.

Cite this