Scheduling algorithms to minimize utility work at a single station on a paced assembly line
Scheduling algorithms to minimize utility work at a single station on a paced assembly line
复制标题
调度算法可最大限度地减少定速装配线上单个工作站的公用事业工作
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
C. Yano
中科院分区：
文献类型：
--
作者：
A. Bolat;C. Yano
摘要Abstract.在这篇文章中，我们解决的问题，排序的一个工作站上的步调装配线没有缓冲区，在这两种类型的操作可以执行。如果一系列工作需要的工作量超过了空间站的处理能力，那么一些工作量，我们称之为效用工作，将保持未完成。我们开发的最佳解决方案的程序，四个相互排斥和集体穷举的问题子类，以最小化总效用工作的目标。对于第四个子类，我们评估在结构上类似于其他子类的最佳程序的方法。我们提供了这些程序之一的最坏情况下的误差界。计算结果表明，非常好的，往往是最佳的，结果可以得到这些程序的组合。
Abstract Abstract. In this article we address the problem of sequencing jobs for one station on a paced assembly line with no buffers, at which two types of operations can be performed. If a subsequence of jobs requires more work than the station can handle, some amount of work, which we call utility work, will remain undone. We develop optimal solution procedures for three of four mutually exclusive and collectively exhaustive problem subclasses, with the goal of minimizing total utility work. For the fourth subclass, we evaluate heuristics that are structurally similar to the optimal procedures for the other subclasses. We provide worst-case error bounds for one of these procedures. Computational results indicate that very good, and often optimal, results can be obtained with a combination of these procedures.