Extension of disjunctive graph model for job shop scheduling problem
Year of publication: |
2001
|
---|---|
Authors: | Błażewicz, Jacek ; Pesch, Erwin ; Sterna, Małgorzata |
Published in: |
Operations research proceedings 2000 : selected papers of the Symposium on Operations Research (OR 2000) ; Dresden, September 9 - 12, 2000. - Berlin : Springer, ISBN 3-540-41587-4. - 2001, p. 359-365
|
Subject: | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Theorie | Theory |
Extent: | graph. Darst |
---|---|
Type of publication: | Article |
Type of publication (narrower categories): | Aufsatz im Buch ; Book section |
Language: | English |
Notes: | Literaturangaben In: Operations research proceedings 2000 |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Inderfurth, Karl, (2000)
-
A branch and bound algorithm for the job shop scheduling problem
Błażewicz, Jacek, (1998)
-
The Stackelberg Minimum Spanning Tree Game on planar and bounded-treewidth graphs
Cardinal, Jean, (2009)
- More ...
-
A branch and bound algorithm for the job shop scheduling problem
Błażewicz, Jacek, (1998)
-
Błażewicz, Jacek, (2008)
-
Handbook on Scheduling : From Theory to Practice
Błażewicz, Jacek, (2019)
- More ...