Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance.
Jean-Paul WatsonLaura BarbulescuL. Darrell WhitleyAdele E. HowePublished in: INFORMS J. Comput. (2002)
Keyphrases
- scheduling problem
- search space
- flowshop
- np hard
- parallel machines
- worst case
- tabu search
- optimal solution
- job shop scheduling problem
- makespan minimization
- optimization algorithm
- search procedure
- objective function
- hybrid algorithm
- job shop
- unrelated parallel machines
- list scheduling
- hill climbing
- solution space
- search strategy
- multistage
- particle swarm optimization
- evolutionary algorithm
- computational complexity