Understanding the Impact of Value Selection Heuristics in Scheduling Problems
Résumé
It has been observed that value selection heuristics have less impact than other heuristic choices when solving hard combinatorial optimization (CO) problems. It is often thought that this is because more time is spent on unsatisfiable sub-problems where the value ordering is irrelevant. In this paper we investigate this belief in the scheduling domain and come up with a more detailed explanation. We find that, even though there are less relevant choices to be made on hard instances, each mistake tends to have a bigger impact, to a point where the potential gain from a value heuristic predominates. Moreover, we observe two interesting and relatively surprising phenomena when solving scheduling problems. First, the accuracy of a given value selection heuristic decreases with the optimality gap. Second, the computational penalty of a mistake increases with the accuracy of the heuristic. For the first observation, we argue that on hard problems, constraint propagation removes a large portion of choices that align with the intuition behind the heuristic. This means that the heuristic faces mostly difficult choices. For the second observation, we argue that simple heuristics tend to make more mistakes on intuitive choice points, and the computational cost for refuting these mistakes is smaller than for those made by a more accurate heuristic.
Domaines
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|---|
| Licence |
![]()
Cite 10.1287/ijoc.3.2.149 Autre Applegate, D., & Cook, W. (1991). A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3(2), 149–156. https://doi.org/10.1287/ijoc.3.2.149
JSP benchmark families (ex. abz, ft, la, orb, swv, ta, yn)
![]()
Cite 10.1016/S0166-218X(96)00116-3 Autre Brucker, P., Hurink, J., Jurisch, B., & Wöstmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76(1–3), 43–59. https://doi.org/10.1016/s0166-218x(96)00116-3
Open-Shop benchmark families (Brucker et al.; Guéret & Prins; Taillard)
![]()
Cite 10.1023/A:1018930613891 Autre Guéret, C., & Prins, C. (1999). A new lower bound for the open‐shop problem. Annals of Operations Research, 92(0), 165–183. https://doi.org/10.1023/a:1018930613891
Open-Shop benchmark families (Brucker et al.; Guéret & Prins; Taillard)
![]()
Cite 10.1016/0377-2217(93)90182-M Autre Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285. https://doi.org/10.1016/0377-2217(93)90182-m
Open-Shop benchmark families (Brucker et al.; Guéret & Prins; Taillard)
![]()
Cite 10.1016/j.cor.2006.11.007 Autre Caumond, A., Lacomme, P., & Tchernev, N. (2008). A memetic algorithm for the job-shop with time-lags. Computers & Operations Research, 35(7), 2331–2356. https://doi.org/10.1016/j.cor.2006.11.007
JSTL instances (Caumond–Lacomme–Tchernev)
![]()
Cite 10.1016/S0377-2217(96)00170-1 Autre Kolisch, R., & Sprecher, A. (1997). PSPLIB - A project scheduling problem library. European Journal of Operational Research, 96(1), 205–216. https://doi.org/10.1016/s0377-2217(96)00170-1
PSPLIB (Kolisch & Sprecher)