Division of Informatics
Forrest Hill & 80 South Bridge
MSc Thesis #93107 | |
|---|---|
| Title: | Single Machine Scheduling Using Partial Constraint Satisfaction |
| Authors: | Dalgarno,M |
| Date: | 1993 |
| Presented: | |
| Keywords: | |
| Abstract: | This thesis is concerned with the role that partial constraint satisfaction can play in the problem of single machine scheduling. Partial constraint satisfaction is a new process which combines branch and bound search with constraint satisfaction techniques. An algorithm is presented for applying partial constraint satisfaction to the single machine scheduling problem. Heuristics to direct this algorithm are described, and compared in terms of their efficiency and the quality of the resulting schedules. |
| Download: | NO ONLINE COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}