调度(生产过程)
数学优化
地铁列车时刻表
运筹学
流水车间调度
实时计算
作者
Sudarshan K. Dhall,C. L. Liu
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:1978-02-01
卷期号:26 (1): 127-140
被引量:518
标识
DOI:10.1287/opre.26.1.127
摘要
We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used, with the goal of meeting all the deadlines with a minimum number of processors. Since the problem of determining the minimum number of processors is difficult, we consider two heuristic algorithms. These are easy to implement and yield a number of processors that is reasonably close to the minimum number. We also analyze the worst-case behavior of these heuristics.
科研通智能强力驱动
Strongly Powered by AbleSci AI