Worst-case analysis of heuristic algorithms for two-machine open shop scheduling problem with route-dependent processing times
Year of publication: |
[1993]
|
---|---|
Authors: | Strusevich, Vitaly A. ; Waart, A. J. van de ; Dekker, Rommert |
Publisher: |
Amsterdam [u.a.] : Tinbergen Inst. |
Subject: | Theorie | Theory | Produktionssteuerung | Production control | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Ozturk, Onur, (2012)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
- More ...
-
Strusevich, Vitaly A., (1993)
-
Two-machine open shop scheduling with an availability constraint
Breit, Joachim, (2000)
-
Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, Joachim, (2001)
- More ...