Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time : bounds and solution strategies
Year of publication: |
2014
|
---|---|
Authors: | Boland, Natashia ; Kalinowski, Thomas ; Kaur, Simranjit |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 64.2015, p. 113-129
|
Subject: | Network models | Maintenance scheduling | Mixed integer programming | Time discretization | Heuristics | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Instandhaltung | Maintenance policy | Heuristik | Ganzzahlige Optimierung | Integer programming |
-
Exact and heuristic methods for the selective maintenance problem
Lust, T., (2009)
-
A branch-and-price approach for trip sequence planning of high-speed train units
Gao, Yuan, (2020)
-
Samouei, Parvaneh, (2023)
- More ...
-
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain
Boland, Natashia, (2013)
-
Understanding the ethical context of organisations : strategies to improve
Kaur, Simranjit, (2016)
-
Regulating international finance and the evolving imbalance of capitalisms since the 1970s
Kalinowski, Thomas, (2011)
- More ...