Inverse interval scheduling via reduction on a single machine

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

doi:10.1016/j.ejor.2022.02.046

Inverse interval scheduling via reduction on a single machine

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

Department of Business Administration

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	541-549
Number of pages	9
Journal	European Journal of Operational Research
Volume	303
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2022.02.046
Publication status	Published - 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

Access to Document

10.1016/j.ejor.2022.02.046

Cite this

@article{b4ece981623345ed99e8d8034848b829,

title = "Inverse interval scheduling via reduction on a single machine",

abstract = "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.",

author = "Seho Yim and Hong, {Sung Pil} and Park, {Myoung Ju} and Yerim Chung",

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: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = dec,

day = "1",

doi = "10.1016/j.ejor.2022.02.046",

language = "English",

volume = "303",

pages = "541--549",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Inverse interval scheduling via reduction on a single machine

AU - Yim, Seho

AU - Hong, Sung Pil

AU - Park, Myoung Ju

AU - Chung, Yerim

N1 - 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.

PY - 2022/12/1

Y1 - 2022/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85126383247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85126383247&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2022.02.046

DO - 10.1016/j.ejor.2022.02.046

M3 - Article

AN - SCOPUS:85126383247

SN - 0377-2217

VL - 303

SP - 541

EP - 549

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

Inverse interval scheduling via reduction on a single machine

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this