An improved algorithm for cyclic flowshop scheduling in a robotic cell

被引：110

作者：

Levner, E ^{[1
]}

Kats, V ^{[1
]}

Levit, VE ^{[1
]}

机构：

[1] BEN GURION UNIV NEGEV,IL-84105 BEER SHEVA,ISRAEL

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1997年 / 97卷 / 03期

关键词：

cyclic scheduling; transporting robot; minimal cycle; complexity;

D O I：

10.1016/S0377-2217(96)00272-X

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m(3) log m) time. (C) 1997 Elsevier Science B.V.

引用

页码：500 / 508

页数：9

共 17 条

[1]

AIZENSHTAT VS, 1963, DOKLADY BYELORUSSIAN, V7, P224

[2]

A BOUNDING SCHEME FOR DERIVING THE MINIMAL CYCLE TIME OF A SINGLE-TRANSPORTER N-STAGE PROCESS WITH TIME-WINDOW CONSTRAINTS [J].