A Mixed Closure-CSP Method to Solve Scheduling Problems
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which interleave (sequentially) searching efforts with the application of consistency enforcing mechanisms and variable/value ordering heuristics. Alternatively, in this paper, we propose a new method that integrates effectively the CSP process into a limited closure process. Such integration allows us to define better informed heuristics. They are used to limit the complete closure process applied, with a number of disjunctive constraints, and so reduce their complexity, while reducing the search space. Moreover, we can maintain more time open disjunctive solutions in the CSP process, limiting the number of backtrackings realized. We show preliminary results obtained from several instances of scheduling problems.
- Albers, S., and Leonardi S.: Online algorithms. ACM Computing surveys, 31(3es) (1999)
- Baptiste, P., Le Pape, C., and Nuijten, W.: Constraint-Based Optimization and Approximation for Job-Shop Scheduling. Paper presented at the IJCAI-95 Workshop on Intelligent Manufacturing Systems, August, Montreal, Canada. 22–25 (1995)
- Barber, F.: Reasoning on Interval and Point-Based Disjunctive Metric Constraints in Temporal Contexts. Journal of Artificial Intelligence Research 12, (2000) 35–86.
- Beek, Peter Van.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4, (1996) 1–18. CrossRef
- Beck, J. C., and Fox, M. S.: A generic framework for constraint-directed search and scheduling. Artificial Intelligence Magazine (1998) 101–129.
- Caseau Y., and Laburthe, F.: Disjunctive Scheduling with Task Intervals. In Proceedings of the Eleventh International Conference on Logic Programming:MIT Press (1994).
- Caseau Y., and Laburthe, F.: Improving Branch and Bound for Job-Shop Scheduling with Constraint Propagation. In Proceedings of the Eighth Franco-Japanesse Conference. Brest, France (1995).
- Dechter, R.: Studies in the use and generation of heuristics. Ph.D. Thesis. UCLA. Los Angeles, CA. (1985).
- Dechter, R., Meiri, I., and Pearl, J.: Temporal Constraint Networks Artificial Intelligence Journal 49 (1991) 61–95.
- Dechter, R.: From local to global consistency Artificial Intelligence 55 (1992) 87–107.
- Garey, M. R., and Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman (1979).
- Garrido, A., M. A. Salido, and Barber, F.: Scheduling in a planning environment. Proceedings of ECAI 2000 Workshop on New Results in planning, scheduling and design, Berlin: (2000) 36–43.
- Mackworth, A. K., and Freuder, E.: The complexity of some polynomial network-consistency algorithms for constraint-satisfaction problems. Artificial Intelligence 25 (1985) 65–74. CrossRef
- Sadeh N.: Look-ahead techniques for micro-opportunistic job shop scheduling. PhD thesis, Dept. of Computer Science, CMU-CS-91-102, Carnegie Mellon University (1991).
- Sadeh, N. M., and Fox, M. S.: Variable and Value Ordering Heuristics for the Job-Shop Scheduling. Constraint Satisfaction Problem. Artificial Intelligence Journal 86 1 (1996) 1–41.
- Smith, S. F., and Cheng, C.: Slack-based heuristics for constraint satisfactions scheduling. Proceedings of the eleventh National Conference on Artificial Intelligence, Washington DC. (1993) 139–144.
- A Mixed Closure-CSP Method to Solve Scheduling Problems
- Book Title
- Engineering of Intelligent Systems
- Book Subtitle
- 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2001 Budapest, Hungary, June 4–7, 2001 Proceedings
- pp 559-570
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. Hungarian Academy of Sciences, Intelligent Manufacturing and Business Processes Computer and Automation Research Institute
- 2. Department of Computer Science 601 University Drive, Southwest Texas State University
- Author Affiliations
- 5. Depto. Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Ap. Correos 99, E-03080, Alicante, Spain
- 6. Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Ap. Correos 22012, E-46020, Valencia, Spain
To view the rest of this content please follow the download PDF link above.