Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
Year of publication: |
2023
|
---|---|
Authors: | Jiang, Xiaojuan ; Lee, Kangbok ; Pinedo, Michael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 305.2023, 2 (1.3.), p. 594-607
|
Subject: | Scheduling | Makespan | Total completion time | Approximation algorithm | Inapproximability | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
-
Zhang, Han, (2023)
-
Minimizing total completion time with machine-dependent priority lists
Ravindran Vijayalakshmi, Vipin, (2024)
- More ...
-
Ideal schedules in parallel machine settings
Jiang, Xiaojuan, (2021)
-
Bicriteria two-machine flowshop scheduling : approximation algorithms and their limits
Jiang, Xiaojuan, (2024)
-
Inventory constrained scheduling on a single machine
Briskorn, Dirk, (2008)
- More ...