Scheduling of coupled tasks and one-machine no-wait robotic cells

被引：30

作者：

Brauner, Nadia ^{[1
]}

Finke, Gerd ^{[1
]}

Lehoux-Lebacque, Vassilissa ^{[1
]}

Potts, Chris ^{[2
]}

Whitehead, Jonathan ^{[2
]}

机构：

[1] Lab G SCOP, F-38031 Grenoble, France

[2] Univ Southampton, Sch Math, Southampton SO17 1BJ, Hants, England

来源：

COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 02期

关键词：

Coupled tasks; Robotic cells; Cyclic production;

D O I：

10.1016/j.cor.2007.10.003

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Coupled task scheduling problems have been known for more than 25 years. Several complexity results have been established in the meantime, but the status of the identical task case remains still unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type in the robotic cell. We shall describe new algorithmic procedures to solve this robotic cell problem, allowing lower and upper bounds on the production time and discussing in particular cyclic production plans. (C) 2007 Elsevier Ltd. All rights reserved.

引用

页码：301 / 307

页数：7

共 7 条

[1] An exact algorithm for scheduling identical coupled tasks [J].