An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Year of publication: |
2002
|
---|---|
Authors: | Della Croce, F. ; Ghirardi, M. ; Tadei, R. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 139.2002, 2, p. 293-301
|
Saved in:
Saved in favorites
Similar items by person
-
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Della Croce, F., (2002)
-
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems
Croce, F.Della, (2004)
-
A greedy-based neighborhood search approach to a nurse rostering problem
Bellanti, F., (2004)
- More ...