Inverse interval scheduling via reduction on a single machine

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

European Journal of Operational Research, 2022, vol. 303, issue 2, 541-549

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.

Keywords: Scheduling; Interval scheduling; Inverse optimization via reduction; Strong NP-hardness; Polynomial time approximation scheme (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221722001679
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:303:y:2022:i:2:p:541-549

DOI: 10.1016/j.ejor.2022.02.046

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().