An Adaptable Scheduling Algorithm for Flexible Flow Lines
An Adaptable Scheduling Algorithm for Flexible Flow Lines
复制标题
DOI：
10.1287/opre.36.3.445
复制
发表时间：
1988-05
期刊：
影响因子：
--
通讯作者：
R. Wittrock
中科院分区：
文献类型：
--
作者：
R. Wittrock
考虑一条生产几种类型的制造线。每个零件必须在几台计算机库中的每台机器中最多都由一台机器处理。本文提出了一种算法，该算法将零件加载到这样的行中。目的主要是为了最大程度地减少makepan，其次是为了最大程度地减少排队。该问题分解为三个子问题，每个子问题都使用快速启发式方法解决。最具挑战性的子问题是找到一个良好的加载顺序，这是使用工作负载概念和动态编程的近似来解决的。我们对算法进行了几次扩展，以便处理有限的存储容量，加快对系统动态的反应。通过计算真实生产线的计算时间表来测试该算法，并讨论了结果。
Consider a manufacturing line that produces parts of several types. Each part must be processed by at most one machine in each of several banks of machines. This paper presents an algorithm that schedules the loading of parts into such a line. The objective is primarily to minimize the makespan and secondarily to minimize queueing. The problem is decomposed into three subproblems and each of these is solved using a fast heuristic. The most challenging subproblem is that of finding a good loading sequence, and this is addressed using workload concepts and an approximation to dynamic programming. We make several extensions to the algorithm in order to handle limited storage capacity, expediting, and reactions to system dynamics. The algorithm was tested by computing schedules for a real production line, and the results are discussed.