An algorithm for solving the job-shop problem
Management Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Encapsulated Search and Constraint Programming in Oz
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Using Oz for College Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Event-Triggered Versus Time-Triggered Real-Time Systems
Proceedings of the International Workshop on Operating Systems of the 90s and Beyond
Allocation and scheduling of real-time periodic tasks with relative timing constraints
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Oz Scheduler: A Workbench for Scheduling Problems
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Evaluation of Search Heuristics for Embedded System Scheduling Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Solving a real-time allocation problem with constraint programming
Journal of Systems and Software
Scheduling of embedded time-triggered systems
Proceedings of the 2007 workshop on Engineering fault tolerant systems
A Framework for Distributing Real-Time Functions
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Models in Software Engineering
An Experimental Model-Based Rapid Prototyping Environment for High-Confidence Embedded Software
RSP '09 Proceedings of the 2009 IEEE/IFIP International Symposium on Rapid System Prototyping
Towards a time-triggered schedule calculation tool to support model-based embedded software design
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Partition configuration for real-time systems with dependencies
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
Thispaper introduces a new class of applications for constraint programming.This new type of application originates out of a special classof real-time systems, enjoying increasing popularity in areassuch as automotive electronics and aerospace industry. Real-timesystems of this kind are time triggered in the sense that theiroverall behavior is globally controlled by a recurring clocktick. Being able to compute an appropriate pre-runtime scheduleautomatically is the major challenge for such an architecture.What makes this specific off-line scheduling problem somewhatuntypical is that a potentially indefinite, periodic processinghas to be mapped onto a single time window. In this article wewill show how this problem can be solved by constraint programmingand we will describe which techniques from traditional schedulingand real-time computing led to success and which failed whenconfronted with a large-scale application of this type. The techniquesthat proved to be the most successful were special global constraintsand an elaborate search heuristics from Operations Research.Also for finding a valid schedule mere serialization is shownto be sufficient. The actual implementation was done in the concurrentconstraint programming language Oz.