Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
Rubing Chen,
Jinjiang Yuan,
C.T. Ng and
T.C.E. Cheng
European Journal of Operational Research, 2021, vol. 293, issue 1, 79-92
Abstract:
In this paper we consider the single-machine hierarchical scheduling problems with release dates and preemption, where the primary criterion is the total completion time and the secondary criterion is an arbitrarily regular scheduling criterion, which is of either the sum-form or the max-form. We aim to find a feasible preemptive schedule that minimizes the secondary criterion, subject to the condition that the primary criterion is minimized. We show that the variants of the problems under study are polynomially solvable. To address these problems, we develop new solution techniques that establish some hereditary properties for the feasible schedules and instances, and present a complete description of the feasible schedules through some elaborately constructed job-permutations.
Keywords: Scheduling; Hierarchical criteria; Release date; Preemption; Total completion time (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172031016X
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:293:y:2021:i:1:p:79-92
DOI: 10.1016/j.ejor.2020.12.006
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 ().