A Solution to a Special Class of Flow Shop Scheduling Problems
A Solution to a Special Class of Flow Shop Scheduling Problems
复制标题
DOI：
10.1007/978-3-642-80784-8_7
复制
发表时间：
1973
期刊：
影响因子：
--
通讯作者：
M. S. Salvador
中科院分区：
文献类型：
--
作者：
M. S. Salvador
本文考虑最一般的“网络”流水作业类型，其中作业通过几个阶段，每个阶段由一个或多个相同的处理机组成。作业在每个阶段的处理器中的任何一个上按阶段编号的升序进行处理，目标是最小化最大完工时间。被认为是一类商店的特点是禁止在过程中的库存和略有限制的工作订购每个处理器。该算法最初是为尼龙聚合的调度而设计的，在本文中开发的算法有许多应用，特别是在化工过程和石油化工生产领域。
This paper considers the most general type of" network" flow shop in which jobs pass through several stages, each of which is composed on one or more identical processors. Jobs are processed on anyone of the processors at each stage in ascending order of stage numbers and the objective is minimization of makespan. The class of shops considered is characterized by prohibited in-process inventory and slightly restricted job ordering per processor. Originally designed for the scheduling of nylon polymerization, the algorithms developed in the paper have numerous applications, especially in the chemical processes and petrochemical production areas.