A Review of Machine Scheduling: Complexity, Algorithms and Approximability
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
复制标题
DOI：
10.1007/978-1-4613-0303-9_25
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Bo Chen;C. Potts;G. Woeginger
中科院分区：
文献类型：
--
作者：
Bo Chen;C. Potts;G. Woeginger
计算机和制造系统的调度已经被广泛研究了四十多年。除了计算机和制造业之外，调度理论还可以应用于许多领域，包括农业，医院和运输。主要重点是随着时间的推移，将一项或多项资源有效地分配给各项活动。采用制造业术语，作业由一个或多个活动组成，机器是一次最多只能执行一个活动的资源。我们专注于确定性的机器编程，假设定义问题实例的所有数据都是确定的。
The scheduling of computer and manufacturing systems has been the subject of extensive research for over forty years. In addition to computers and manufacturing, scheduling theory can be applied to many areas including agriculture, hospitals and transport. The main focus is on the efficient allocation of one or more resources to activities over time. Adopting manufacturing terminology, ajobconsists of one or more activities, and amachineis a resource that can perform at most one activity at a time. We concentrate ondeterministic machine schedulingfor which it is assumed that all data that define a problem instance are known with certainty.