Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents
Year of publication: |
2014
|
---|---|
Authors: | Mor, B. ; Mosheiov, Gur |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 65.2014, 1, p. 151-157
|
Subject: | two-agent scheduling | proportionate flowshop | makespan | total completion time | number of tardy jobs | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Evolutionärer Algorithmus | Evolutionary algorithm | Branch-and-Bound | Branch and Bound |
-
Nasrollahi, Vahid, (2022)
-
Parameterized complexity of machine scheduling : 15 open problems
Mnich, Matthias, (2018)
-
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Jeong, BongJoo, (2014)
- More ...
-
The equal allocation policy in open shop batch scheduling
Mor, B., (2012)
-
Minmax scheduling problems with common flow-allowance
Mor, B., (2012)
-
Scheduling problems with earliness and tardiness costs : a just in time approach
Mosheiov, Gur, (1991)
- More ...