Local probing applied to scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 155-171

  Kamarainen, Olli ^a   El Sakkout, Hani ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; SCHEDULING;

BACKTRACK SEARCH; COMPLEX CONSTRAINTS; CONSTRAINED PROBLEM; CONSTRAINT SATISFACTION TECHNIQUES; FINDING SOLUTIONS; LOCAL CONSISTENCY TECHNIQUES; OVERLAPPING CONSTRAINTS; RESOURCE CONSTRAINED SCHEDULING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33746067785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_11     Document Type: Conference Paper

References (28)

1. F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Proc. of CP-AI-OR’01, pages189–203, 2001
2. N. Barnier and P. Brisset. Combine& conquer: Genetic algorithm and CP for optimization. In Proc. of CP98, page 436, 1998.
3. C. Beck and P. Refalo. A hybrid approach to scheduling with earliness and tardiness costs. In Proc. of CP-AI-OR’01, pages175–188, 2001
4. Y. Caseau and F. Laburthe. Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3):281–303, 1999.
5. A. Cesta, A. Oddi, and S. Smith. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1):109–136, 2002.
6. A. El-Kholy and B. Richards. Temporal and resource reasoning in planning: The parcPLAN approach. In Proc. of ECAI96, pages614–618, 1996
7. H. El Sakkout. Improving Backtrack Search: Three Case Studies of Localized Dynamic Hybridization. PhD Thesis, Imperial College, London, 1999.
8. H. El Sakkout, T. Richards, and M. Wallace. Minimal perturbation in dynamic scheduling. In Proc. of ECAI98, pages 504–508, 1998.
9. H. El Sakkout and M. Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359–388, 2000.
10. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In Handbook on Metaheuristics, Kluwer, 2002. To be published. 156
11. F. Glover. Future pathsfor integer programming and linkst o artificial intelligence. Computers & Operations Research, 5:533–549, 1986.
12. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
13. W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proc. Of IJCAI95, pages 607–615, 1995.
14. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
15. J. N. Hooker, Hak-Jin Kim, and G. Ottosson. A declarative modeling framework that integrates solution methods. Annals of Operations Res., 104:141–161, 2001.
16. IC-Parc. ECLiPSe User manual. http://www.icparc.ic.ac.uk/eclipse/, 2001.
17. N. Jussien and O. Lhomme. Local search with constraint propagation and conflictbased heuristics. In Proc. of AAAI-00, pages169–174, 2000.
18. O. Kamarainen, H. El Sakkout, and J. Lever. Local probing for resource constrained scheduling. In Proc. of the CP01 Workshop on Cooperative Solvers, 2001
19. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.
20. L. Michel and P. Van Hentenryck Localizer: A modeling language for local search. In Proc. of CP97, pages 237–251, 1997
21. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161–205, 1992.
22. N. Mladenovic and P. Hansen. Variable neighbourhood search. Computers & Operations Research, 24:1097–1100, 1997.
23. G. Pesant and M. Gendreau. A constraint programming framework for local search methods. Journal of Heuristics, 5(3):255–279, 1999.
24. A. Schaerf. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proc. of IJCAI97, pages 1254–1259, 1997.
25. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proc. of CP98, pages 417–431, 1998.
26. C. Voudouris and E. Tsang. Partial constraint satisfaction problems and guided local search. In Proc. of PACT96, pages 337–356, 1996.
27. M. Wallace and J. Schimpf. Finding the right hybrid algorithm - a combinatorial meta-problem. Annals of Math. and Artificial Intelligence, 34(4):259–269, 2002.
28. J. Zhang and H. Zhang. Combining local search and backtracking techniques for constraint satisfaction. In Proc. of AAAI96, pages 369–374, 1996