Scheduling Parts in a Combined Production-transportation Work Cell
作者:
SternHelman I.,
VitnerGad,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1990)
卷期:
Volume 41,
issue 7
页码: 625-632
ISSN:0160-5682
年代: 1990
DOI:10.1057/jors.1990.86
出版商: Taylor&Francis
关键词: algorithm;flowshop;production scheduling;work cell
数据来源: Taylor
摘要:
AbstractThis paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is donenat a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(nlogn) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.
点击下载:
PDF (3312KB)
返 回