Search Procedures and Parallelism in Constraint Programming
Author:
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 346-360
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Constraint-Based Job Shop Scheduling with IILOG SCHEDULERJournal of Heuristics, 1998
- Salsa: A Language for Search Algorithms1998
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- A view of local search in constraint programming1996
- Evolution based learning in a job shop scheduling environmentComputers & Operations Research, 1995
- A Computational Study of Local Search Algorithms for Job Shop SchedulingINFORMS Journal on Computing, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Principles of the Delphi Parallel Inference MachineThe Computer Journal, 1987