Preemptive parallel-machine scheduling with a common server to minimize makespan

T. C.E. Cheng, Svetlana A. Kravchenko, Miao-Tsong Lin*

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

We consider parallel-machine scheduling with a common server and job preemption to minimize the makespan. While the non-preemptive version of the problem is strongly NP-hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP-hard even if there is a fixed number of machines. We give a pseudo-polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP-hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases.

Original languageEnglish
Pages (from-to)388-398
Number of pages11
JournalNaval Research Logistics
Volume64
Issue number5
DOIs
StatePublished - 1 Aug 2017

Keywords

  • common server
  • makespan
  • parallel machines
  • preemption
  • scheduling

Fingerprint Dive into the research topics of 'Preemptive parallel-machine scheduling with a common server to minimize makespan'. Together they form a unique fingerprint.

  • Cite this