The longest processing time rule for identical parallel machines revisited
Year of publication: |
2020
|
---|---|
Authors: | Della Croce, Federico ; Scatamacchia, Rosario |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 23.2020, 2, p. 163-172
|
Subject: | Identical parallel machine scheduling | LPT rule | Linear programming | Approximation algorithms | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time |
-
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
Lee, Myungho, (2022)
-
Wang, Shijin, (2021)
-
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
Shabtay, Dvir, (2024)
- More ...
-
A new exact approach for the 0-1 Collapsing Knapsack Problem
Della Croce, Federico, (2017)
-
An exact approach for the 0-1 knapsack problem with setups
Della Croce, Federico, (2017)
-
Alfieri, Arianna, (2021)
- More ...