by Jean-paul Watson, J. Christopher Beck, Adele E. Howe, L. Darrell Whitley
http://www.cs.colostate.edu/~genitor/2002/ecp01.ps.gz
Add To MetaCart
Abstract:
Abstract. Local search algorithms are among the most eective approaches for solving the JSP, yet we have little understanding of why these algorithm work so well, and under what conditions. We develop descriptive cost models of local search for the job-shop scheduling problem (JSP), borrowing from the models developed for MAX-SAT. We show that several factors known to in
uence the diculty of local search in MAX-SAT directly carry over to the general JSP, including the number of optimal solutions, backbone size, the distance between initial solutions and the nearest optimal solution, and an analog of backbone robustness. However, these same factors only weakly in
uence local search cost in JSPs with work
ow, which possess structured constraints. While the factors present in the MAX-SAT cost models provide an accurate description of local search cost in the general JSP, our results for work
ow JSPs raise concerns regarding the applicability of cost models derived using random problems to those exhibiting specic structure. 1
Citations
|
58
|
Stochastic local search - methods, models, applications
– Hoos
- 1998
|
|
50
|
Job shop scheduling by simulated annealing
– Laarhoven, Aarts, et al.
- 1992
|
|
48
|
When Gravity Fails: Local Search Topology. , 7:249-281. . [online], available at
– Frank, Cheeseman, et al.
- 1997
|
|
44
|
Local search and the number of solutions
– Clark, Frank, et al.
- 1996
|
|
39
|
The job-shop scheduling problem: Conventional and new solution techniques
– Blazewicz, Domschke, et al.
- 1996
|
|
38
|
Clustering at the phase transition
– Parkes
- 1997
|
|
30
|
Backbone fragility and the local search cost peak
– Singer, Gent, et al.
- 2000
|
|
21
|
Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
– Beck, Fox
- 2000
|
|
16
|
A search space analysis of the job shop scheduling problem
– Mattfeld, Bierwirth, et al.
- 1999
|
|
16
|
Combinatorial landscapes
– Reidys, Stadler
- 2002
|
|
8
|
A fast taboo search algorithm for the job shop problem
– Nowicki, Smutnicki
- 1996
|
|
1
|
Taillard: Parallel taboo search techniques for the job shop scheduling problem
– Eric
- 1994
|
