Cyclic schedules for job shops with identical jobs
Mathematics of Operations Research
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Procedural reasoning in constraint satisfaction
Procedural reasoning in constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Developing a Deterministic Patrolling Strategy for Security Agents
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
The general yard allocation problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Precedence constraint posting for cyclic scheduling problems
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A constraint based approach to cyclic RCPSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Global cyclic cumulative constraint
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CROSS cyclic resource-constrained scheduling solver
Artificial Intelligence
Hi-index | 0.00 |
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.