Algorithms for two-machine flow-shop sequencing with precedente constraints
Year of publication: |
1984
|
---|---|
Authors: | Hariri, A. M. A. ; Potts, C. N. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 17.1984, 2, p. 238-248
|
Subject: | Unternehmensforschung | Reihenfolgeproblem |
-
Gschrei, Ulrich, (1983)
-
Schnittebenenverfahren für Travelling-Salesman- und verwandte Probleme
Holland, Olaf A., (1987)
-
Logistische Routenplanung unter Zeitrestriktionen : eine Simulationsstudie
Grupp, Bernhard, (1987)
- More ...
-
Single machine scheduling to minimize total weighted late work
Hariri, A. M., (1992)
-
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
Hariri, A. M. A., (1989)
-
A branch and bound algorithm for the two-stage assembly scheduling problem
Hariri, A. M. A., (1997)
- More ...