Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
Year of publication: |
2002
|
---|---|
Authors: | Watson, Jean-Paul ; Barbulescu, Laura ; Darrell Whitley, L. ; Howe, Adele E. |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 14.2002, 2, p. 98-123
|
Saved in:
Saved in favorites
Similar items by person
-
Revisiting the big valley search space structure in the TSP
Hains, Douglas Ryan, (2011)
-
Efficient primal heuristic updates for the blocking job shop problem
Mogali, Jayanth Krishna, (2021)
-
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem
Bierwirth, Christian, (2004)
- More ...