In the single-vehicle scheduling problem with time window constraints, a vehicle has to visit a set of sites on a graph, and each site must be visited after its ready time but no later than its deadline. The goal is to minimize the total time taken to visit all sites. We prove the conjecture propose
Scheduling real-time computations with separation constraints
โ Scribed by Ching-Chih Han; Kwei-Jay Lin
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 565 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method
Two types of applications are considered: hard real-time (HRT) and soft real-time (SRT). HRT applications need to meet their deadlines under all circumstances; deadlines of SRT applications may occasionally be missed. Both applications are constructed from objects. HRT and SRT applications coexist o
Electric power dispatching from generating plants should be governed by limits on fuel costs and the air quality. The constrained optimization procedure promises to achieve these goals in a dynamic environment.
## Real-Time Image Processing with a MIMD Computer mage processing applications require both computing and communication power. The aim of the GFLOPS project was to study all aspects concerning the design of such computers. The projects' Iai m was to develop a parallel architectures well as its so