A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking
Year of publication: |
2005
|
---|---|
Authors: | Ronconi, Débora P. |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 138.2005, p. 53-66
|
Saved in:
Saved in favorites
Similar items by person
-
Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
Hino, Celso M., (2005)
-
A note on constructive heuristics for the flowshop problem with blocking
Ronconi, Débora P., (2004)
-
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
Ronconi, Débora P., (2009)
- More ...