The two-machine maximum flow time problem with series-parallel precedence constraints: an algorithm and extensions
Year of publication: |
1979
|
---|---|
Authors: | Monma, Clyde L. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 27.1979, 4, p. 792-798
|
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 ...
-
Linear-time algorithms for scheduling on parallel processors
Monma, Clyde L., (1982)
-
Sequencing to minimize the maximum job cost
Monma, Clyde L., (1980)
-
On the computational complexity of integer programming problems
Kannan, Ravindran, (1977)
- More ...