Search procedures and parallelism in constraint programming

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

Volumn 1713, Issue , 1999, Pages 346-361

  Perron, Laurent ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

BRUTE FORCE SEARCH; COMPLETE SEARCH; CONSTRAINT PROGRAMMING; INCOMPLETE SEARCHES; OBJECT ORIENTED; SEARCH PROCEDURES; SHARED-MEMORY COMPUTERS;

OBJECT ORIENTED PROGRAMMING;

EID: 84957371379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_25     Document Type: Conference Paper

References (20)

1. E. H. L. Aarts, P. J. M. van Laarhoven, J. K. Lenstra, and N. J. L. Ulder. A computational study of local search algorithms for job shop scheduling. 6:113–125, 1994.
2. D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2):149–156, 1991.
3. J. W. Barnes and J. B. Chambers. Solving the job shop scheduling problem using tabu search. IEE Transactions, 27/2:257–263, 1994.
4. W. Clocksin. Principles of the DelPhi parallel inference machine. Computer Journal, 30(5):386–392, 1987.
5. M. Dell’Amico and M. Trubian. Appplying tabu-search to the job-shop scheduling problem. Annals of Operational Research, 41:231–252, 1993.
6. U. Dorndorf and E. Pesch. Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22:25–40, 1995.
7. G. L. Thompson H. Fisher. Probabilistic learning combinations of local job-shop scheduling rules. In G. L. Thompson J. F. Muth, editor, Industrial Scheduling, pages 225–251. Prentice Hall, Englewood Cliffs, New Jersey, 1963.
8. William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceeding of IJCAI, volume 1, pages 607–613, August 1995.
9. E. Balas J. Adams and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34:391–401, 1988.
10. Fran¸cois Laburthe and Yves Caseau. Salsa: A language for search algorithms. In Principles and Practice of Constraint Programming, number 1520 in LNCS, pages 310–325, 1998.
11. S Lawrence. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Carnegie-Mellon University, Pennsylvania, 1984. supplement.
12. Pedro Meseguer. Interleaved depth-first search. In International Joint Conference on Artificial Intelligence, volume 2, pages 1382–1387, August 1997.
13. L. Michel and P. Van Hentenryck. Localizer: A modelling language for local search. In CP’97, number 1330 in LNCS. Springer, 1997.
14. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797–813, 1996.
15. W. Nuijten and C. Le Pape. Constraint-based job shop scheduling with ilog scheduler. Journal of Heuristics, 3:271–286, 1998.
16. Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.
17. Laurent Perron. An implementation of or-parallelism based on direct access to the MMU. In Proc. of Compulog-Net worshop on parallelism and implementation technology, JICSLP’96, 1996.
18. G. Pesant and M. Gendreau. A view of local search in constraint programming. In CP’96, number 1118 in LNCS, pages353–366. Springer, 1996.
19. Christian Schulte. Oz Explorer: A visual constraint programming tool. In Lee Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 286–300, Leuven, Belgium, July 1997. The MIT Press.
20. Toby Walsh. Depth-bounded discrepancy search. In International Joint Conference on Artificial Intelligence, volume 2, pages 1388–1393, August 1997.