Inverse interval scheduling via reduction on a single machine

Seho Yim, Sung Pil Hong, Myoung Ju Park, Yerim Chung

Research output: Contribution to journalArticlepeer-review


We consider an inverse counterpart of the interval scheduling problem. In the problem, we are given a set of machines and the objective is to reduce the non-preemptive job intervals with a least cost so that all jobs with positive processing times may be scheduled on the machines. The paper focuses on the single machine case. We establish the strong NP-hardness of the problem and show however it admits a polynomial time approximation scheme.

Original languageEnglish
Pages (from-to)541-549
Number of pages9
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 2022 Dec 1

Bibliographical note

Funding Information:
We are grateful to three anonymous referees for their helpful comments for revision of the paper. Especially, the first referee introduced Fontan (2019) which was very useful in improving the paper. We also thank Max Kapur for his kind help in revision.

Publisher Copyright:
© 2022 Elsevier B.V.

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Inverse interval scheduling via reduction on a single machine'. Together they form a unique fingerprint.

Cite this