Efficient and exact solutions for job shop scheduling problems via a generalized colouring algorithm for tree-like graphs
Year of publication: |
September 2016
|
---|---|
Authors: | Soller, Henning ; Kulmann, Friedhelm ; Rödder, Wilhelm |
Published in: |
International journal of operations and quantitative management : IJOQM. - Houston, Tex. : INFOMS, ISSN 1082-1910, ZDB-ID 1290624-4. - Vol. 22.2016, 3, p. 253-272
|
Subject: | Treelike | Graph | Scheduling | Jop Shop Problem | Rostering | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Thevenin, Simon, (2017)
-
Optimisation of block erection scheduling based on a Petri net and discrete PSO
Zhong, Yuguang, (2012)
-
Scheduling : agreement graph vs resource constraints
Bendraouche, Mohamed, (2015)
- More ...
-
WHERE WE STAND AT PROBABILISTIC REASONING
Rödder, Wilhelm, (2009)
-
Erinnerung und Abruf aus dem GedächtnisEin informationstheoretisches Modell kognitiver Prozesse
Rödder, Wilhelm, (2003)
-
Von der Prädikatenlogik zur unternehmerischen Entscheidungsunterstützung
Kulmann, Friedhelm, (2003)
- More ...