A common approximation framework for early work, late work, and resource leveling problems

Péter Györgyi and Tamás Kis

European Journal of Operational Research, 2020, vol. 286, issue 1, 129-137

Abstract: We study the approximability of four scheduling problems on identical parallel machines. In the late work minimization problem, the jobs have arbitrary processing times and a common due date, and the objective is to minimize the late work, defined as the sum of the portion of the jobs done after the due date. A related problem is the maximization of the early work, defined as the sum of the portion of the jobs done before the due date. We describe a polynomial time approximation scheme for the early work maximization problem, and we extended it to the late work minimization problem after shifting the objective function by a positive value that depends on the problem data. We also prove an inapproximability result for the latter problem if the objective function is shifted by a constant which does not depend on the input. These results remain valid even if the number of the jobs assigned to the same machine is bounded. This leads to an extension of our approximation scheme to two variants of the resource leveling problem with unit time jobs, for which no approximation algorithm is known.

Keywords: Scheduling; late work minimization; early work maximization; resource leveling; approximation algorithms (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221720302460
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:286:y:2020:i:1:p:129-137

DOI: 10.1016/j.ejor.2020.03.032

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 ().