Closing the open shop: Contradicting conventional wisdom

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

Volumn 5732 LNCS, Issue , 2009, Pages 400-408

  Grimes, Diarmuid ^a   Hebrard, Emmanuel ^a   Malapert, Arnaud ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT MODEL; CONSTRAINT PROPAGATORS; DOMAIN SPECIFIC; JOB SHOP PROBLEM; JOB-SHOP SCHEDULING; NEW APPROACHES; OPEN SHOP;

CONSTRAINT THEORY; HEURISTIC METHODS;

COMPUTER PROGRAMMING;

EID: 70350407146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_33     Document Type: Conference Paper

References (23)

1. Malapert, A., Cambazard, H., Guéret, C., Jussien, N., Langevin, A., Rousseau, L.-M.: An Optimal Constraint Programming Approach to the Open-Shop problem. Submitted to INFORMS, Journal of Computing (2008)
2. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming Techniques to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
3. Beck, J.C., Davenport, A.J., Sitarski, E.M., Fox, M.S.: Texture-Based Heuristics for Scheduling Revisited. In: AAAI/IAAI, pp. 241-248 (1997)
4. Christopher Beck, J.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. Journal of Artificial Intelligence Research 29, 49-77 (2007)
5. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain, August 2004, pp. 482-486 (2004)
6. Brucker, P., Hurink, J., Jurisch, B., Wöstmann, B.: A Branch & Bound Algorithm for the Open-shop Problem. In: GO-II Meeting: Proceedings of the Second International Colloquium on Graphs and Optimization, pp. 43-59. Elsevier Science Publishers B. V., Amsterdam (1997)
7. Carlier, J., Pinson, E.: An Algorithm for Solving the Job-shop Problem. Management Science 35(2), 164-176 (1989)
8. The choco team. choco: an Open Source Java Constraint Programming Library. In: The Third International CSP Solver Competition, pp. 31-40 (2008)
9. Fox, M.S., Sadeh, N.M., Baykan, C.A.: Constrained heuristic search. In: IJCAI, pp. 309-315 (1989)
10. Guéret, C., Prins, C.: A new Lower Bound for the Open Shop Problem. Annals of Operations Research 92, 165-183 (1999)
11. Hebrard, E.: Mistral, a Constraint Satisfaction Library. In: The Third International CSP Solver Competition, pp. 31-40 (2008)
12. Laborie, P.: Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and new Results. Artificial Intelligence 143(2), 151-188 (2003)
13. Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131-136 (2007)
14. Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: ISTCS, pp. 128-133 (1993)
15. Meiri, I.: Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In: AAAI, pp. 260-267 (1991)
16. Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Manage. Sci. 42(6), 797-813 (1996)
17. Nowicki, E., Smutnicki, C.: An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling 8(2), 145-159 (2005)
18. Nuijten, W.: Time and Resource Constraint Scheduling: A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology (1994)
19. Le Pape, C.: Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering 3, 55-66 (1994)
20. Sha, D.Y., Hsu, C.-Y.: A new Particle Swarm Optimization for the Open Shop Scheduling Problem. Computers & Operation Research 35(10), 3243-3261 (2008)
21. Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operations Research 64, 278-285 (1993)
22. Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172-1177 (1999)
23. Watson, J.-P., Beck, J.C.: A Hybrid Constraint Programming/Local Search Approach to the Job-Shop Scheduling Problem. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 263-277. Springer, Heidelberg (2008)