Improved approaches to the exact solution of the machine covering problem
Year of publication: |
April 2017
|
---|---|
Authors: | Walter, Rico ; Wirth, Martin ; Lawrinenko, Alexander |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 2, p. 147-164
|
Subject: | Identical parallel machines | Machine covering | Dominance criteria | Branch-and-bound | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Jarboui, Bassem, (2024)
-
Jin, Bo, (2023)
-
Li, Chu-Min, (2017)
- More ...
-
Lower bounds and algorithms for the minimum cardinality bin covering problem
Walter, Rico, (2017)
-
Lawrinenko, Alexander, (2017)
-
Comparing the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2010)
- More ...