A branch and bound algorithm for the job shop scheduling problem
Year of publication: |
1998
|
---|---|
Authors: | Błażewicz, Jacek |
Other Persons: | Pesch, Erwin (contributor) ; Sterna, Małgorzata (contributor) |
Published in: |
Beyond manufacturing resource planning (MRP II) : advanced models and methods for production planning ; with 36 tables. - Berlin : Springer, ISBN 3-540-64247-1. - 1998, p. 219-254
|
Subject: | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A supernodal formulation of vertex colouring with applications in course timetabling
Burke, Edmund K., (2010)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Petri net and its application in deadlock detection
Penm, Jack H. W., (2009)
- More ...
-
Błażewicz, Jacek, (2008)
-
Extension of disjunctive graph model for job shop scheduling problem
Błażewicz, Jacek, (2001)
-
Mirror scheduling problems with early work and late work criteria
Chen, Xin, (2021)
- More ...