Solving the job-shop scheduling problem optimally by dynamic programming
Year of publication: |
2012
|
---|---|
Authors: | Gromicho, Joaquim A. S. ; Hoorn, Jelke J. van ; Saldanha-da-Gama, Francisco ; Timmer, Gerrit Theodor |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 12, p. 2968-2977
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Produktionssteuerung | Production control |
Description of contents: | Description [doi.org] |
Extent: | graph. Darst. |
---|---|
Type of publication: | Article |
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | Corrigendum enthalten in: Volume 78, February 2017, Seite 381 |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Balancing reconfigurable machining lines via a set partitioning model
Borisovsky, Pavel A., (2014)
-
Pruning rules for optimal runway sequencing
De Maere, Geert, (2018)
-
Bosio, Alberto, (2009)
- More ...
-
A note on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
Hoorn, Jelke J. van, (2015)
-
Gromicho, Joaquim A. S., (2010)
-
A note on the worst case complexity for the capacitated vehicle routing problem
Hoorn, Jelke J. van, (2010)
- More ...