Minimizing total completion time with machine-dependent priority lists

Vipin Ravindran Vijayalakshmi, Marc Schröder*, Tami Tamir

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We consider a natural, yet challenging variant of the parallel machine scheduling problem in which each machine imposes a preferential order over the jobs and schedules the jobs accordingly once assigned to it. We study the problem of minimizing the total completion time, distinguishing between identical and unrelated machines, machine-dependent and identical priority lists, or a constant number of different priority classes. Additionally, we consider the setting in which the priority list on a machine must satisfy longest processing time first. We resolve the computational complexity of the problem and provide a clear distinction between problems that are polynomial time solvable and APX-hard.
Original languageEnglish
Pages (from-to)844-854
Number of pages11
JournalEuropean Journal of Operational Research
Volume315
Issue number3
Early online date3 Jan 2024
DOIs
Publication statusPublished - 16 Jun 2024

Keywords

  • Total completion time
  • priorities
  • dynamic programming
  • Inapproximability

Fingerprint

Dive into the research topics of 'Minimizing total completion time with machine-dependent priority lists'. Together they form a unique fingerprint.

Cite this