| Title: | Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion | Authors: | Chen, R Yuan, J Ng, CT Cheng, TCE |
Issue Date: | Aug-2021 | Source: | European journal of operational research, 16 Aug. 2021, v. 293, no. 1, p. 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: | Hierarchical criteria Preemption Release date Scheduling Total completion time |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | DOI: | 10.1016/j.ejor.2020.12.006 |
| Appears in Collections: | Journal/Magazine Article |
Access
View full-text via PolyU eLinks 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.