On polynomial solvability of two multiprocessor scheduling problems
Year of publication: |
1999
|
---|---|
Authors: | Girlich, Eberhard ; Tarnovskij, Aleksandr G. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 50.1999, 1, p. 27-51
|
Subject: | Scheduling-Verfahren | Scheduling problem | Verpackung | Packaging | Packproblem | Packing problem | Theorie | Theory |
Extent: | Graph. Darst |
---|---|
Type of publication: | Article |
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | In: Mathematical methods of operations research |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Integrated order scheduling and packing
Chen, Zhi-long, (2009)
-
Packing problems and project scheduling models : an integrating perspective
Hartmann, Sönke, (1999)
-
Packing problems and project scheduling models : an integrated perspective
Hartmann, Sönke, (1999)
- More ...
-
On polynomial solvability of two multiprocessor scheduling problems
Girlich, Eberhard, (1999)
-
Nichtlineare diskrete Optimierung
Girlich, Eberhard, (1981)
-
Greedy sets and related problems
Girlich, Eberhard, (1997)
- More ...