Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
Year of publication: |
March 2017
|
---|---|
Authors: | Agnetis, Alessandro ; Detti, Paolo ; Martineau, Patrick |
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. 79.2017, p. 109-118
|
Subject: | Unrecoverable interruptions | Parallel machines scheduling | NP-hardness | Exact and heuristic algorithms | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Produktionssteuerung | Production control |
-
Corominas, Albert, (2019)
-
Belkaid, Fayçal, (2016)
-
An O(n log n) algorithm for the two-machine flow shop problem with variable machine speeds
Hoesel, C. P. van, (1993)
- More ...
-
Sequencing unreliable jobs on parallel machines
Agnetis, Alessandro, (2009)
-
Optimal packet-to-slot assignment in mobile telecommunications
Detti, Paolo, (2009)
-
Optimal packet-to-slot assignment in mobile telecommunications
Detti, Paolo, (2009)
- More ...