Constraint logic programming for scheduling and planning

J. Lever, M. Wallace, B. Richards

Research output: Contribution to journalArticleResearchpeer-review

21 Citations (Scopus)

Abstract

This paper provides an introduction to finite-domain constraint logic programming (CLP) and its application to problems in scheduling and planning. The fundamentals of CLP are covered and recent developments and trends in the field are indicated. Some current limitations are identified, and areas of research that may contribute to addressing these limitations are suggested.

Original languageEnglish
Pages (from-to)73-80
Number of pages8
JournalBritish Telecom Technology Journal
Volume13
Issue number1
Publication statusPublished - 1 Jan 1995

Cite this