{"type":"ScholarlyArticle","title":"Cyclic Scheduling","authors":[{"name":"Denise Draper","slug":"denise-draper","given":"Denise","family":"Draper","affiliation":""},{"name":"Ari K. Jónsson","slug":"ari-k-jonsson","given":"Ari K.","family":"Jónsson","affiliation":""},{"name":"David P. Clements","slug":"david-p-clements","given":"David P.","family":"Clements","affiliation":""},{"name":"David Joslin","slug":"david-joslin","given":"David","family":"Joslin","affiliation":""}],"abstract":"In this paper we consider the problem of cyclic schedules such as arise in manufacturing. We introduce a new formulation of this problem that is a very simple modification of a standard job shop scheduling formulation, and which enables us to use existing constraint reasoning techniques to generate cyclic schedules. We present evidence for the effectiveness of this formulation, and describe extensions for handling multiple-capacity resources and for recovering from breaks in cyclic schedules.","doi":null,"url":"https://ijcai.org/proceedings/1999/145","pdf":"https://ijcai.org/proceedings/1999/0145.pdf","markdown":"https://ijcai.org/proceedings/1999/145.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/145","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Scheduling","track":"Planning and Scheduling","number":145,"pages":{"first":1016,"last":1020},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}