Part sequencing in three-machine no-wait robotic cells

被引：41

作者：

Agnetis, A

Pacciarelli, D

机构：

[1] Univ Rome La Sapienza, Dipartimento Informat & Sistemist, I-00185 Rome, Italy

[2] Univ Roma Tre, Dipartimento Inforamat & Automaz, I-00146 Rome, Italy

来源：

OPERATIONS RESEARCH LETTERS | 2000年 / 27卷 / 04期

关键词：

robotic cells; no-wait flow shop; polynomial algorithms; NP-complete problems;

D O I：

10.1016/S0167-6377(00)00046-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

A no-wait robotic cell is an automated flow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for different periodical patterns of robot moves, when the objective is productivity maximization. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：185 / 192

页数：8

共 9 条

[1]

Scheduling no-wait robotic cells with two and three machines [J].