Scheduling Groups of Jobs on a Single Machine
Scheduling Groups of Jobs on a Single Machine
复制标题
DOI：
10.1287/opre.43.4.692
复制
发表时间：
1995-08
期刊：
影响因子：
--
通讯作者：
S. Webster;K. R. Baker
中科院分区：
文献类型：
--
作者：
S. Webster;K. R. Baker
规模经济是制造运营的基础。就调度而言，这种现象表现为将相似的作业分组在一起所获得的效率。本文回顾了有关单机调度模型的快速增长的文献，该模型结合了作业分组的好处。我们重点关注三种基本模型，即具有项目可用性的系列调度、具有批量可用性的系列调度和批处理。我们展示已知的结果并引入新的结果，并且我们特别关注关键的理论属性以及这些属性在优化过程中的使用。
Economies of scale are fundamental to manufacturing operations. With respect to scheduling, this phenomenon manifests itself in efficiencies gained from grouping similar jobs together. This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping. We focus on three basic models known as family scheduling with item availability, family scheduling with batch availability, and batch processing. We present known results and introduce new results, and we pay special attention to key theoretical properties and the use of these properties in optimization procedures.