Scheduling on parallel identical machines with late work criterion : offline and online cases
Year of publication: |
December 2016
|
---|---|
Authors: | Chen, Xin ; Sterna, Małgorzata ; Han, Xin ; Błażewicz, Jacek |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 19.2016, 6, p. 729-736
|
Subject: | Online and offline scheduling | Identical parallel machines | Late work | NP-hardness | Competitive ratio | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
A note on the Coffman-Sethi bound for LPT scheduling
Blocher, James D., (2015)
-
Wang, Xiuli, (2015)
-
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
Xu, Xiaoqing, (2013)
- More ...
-
Mirror scheduling problems with early work and late work criteria
Chen, Xin, (2021)
-
Two-machine flow shop scheduling with a common due date to maximize total early work
Chen, Xin, (2022)
-
Chen, Xin, (2020)
- More ...