A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
Year of publication: |
2021
|
---|---|
Authors: | Cheriyan, Joseph ; Ravi, Ramamoorthi ; Skutella, Martin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 842-843
|
Subject: | Moore-Hodgson Algorithm | Number of late jobs | Scheduling theory | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Moderate exponential-time algorithms for scheduling problems
T'kindt, Vincent, (2022)
-
Muggy, Luke, (2015)
-
Shop scheduling in manufacturing environments : a review
Márquez, Carlos R. H., (2022)
- More ...
-
On orienting graphs for connectivity: Projective planes and Halin graphs
Cheriyan, Joseph, (2012)
-
Unconstrained traveling tournament problem is APX-complete
Bendayan, Salomon, (2023)
-
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
Grout, Logan, (2023)
- More ...