Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/90701
Title: | Bicriteria scheduling to minimize total late work and maximum tardiness with preemption | Authors: | Chen, R Yuan, J Ng, CT Cheng, TCE |
Issue Date: | Sep-2021 | Source: | Computers and industrial engineering, Sept. 2021, v. 159, 107525 | Abstract: | We consider single-machine bicriteria scheduling of n jobs with preemption to minimize the total late work and maximum tardiness. Given the earliest due date order of the jobs in advance, we present an O(n)-time algorithm for the hierarchical scheduling problem and an O(nlogn)-time algorithm for the constrained scheduling problem. For the Pareto-scheduling problem, when all the processing times and due dates are integral, we construct the trade-off curve in O(nlognP) time, where P is the total processing time of the jobs. | Keywords: | Bicriteria scheduling Maximum tardiness Preemption Total late work |
Publisher: | Pergamon Press | Journal: | Computers and industrial engineering | ISSN: | 0360-8352 | EISSN: | 1879-0550 | DOI: | 10.1016/j.cie.2021.107525 |
Appears in Collections: | Journal/Magazine Article |
Show full item record
Page views
119
Last Week
0
0
Last month
Citations as of May 5, 2024
SCOPUSTM
Citations
7
Citations as of May 3, 2024
WEB OF SCIENCETM
Citations
8
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.