A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

被引：24

作者：

Kogan, K

Levner, E

机构：

[1] CTR TECHNOL EDUC HOLON, DEPT COMPUTERIZED SYST, IL-58102 HOLON, ISRAEL

[2] TEL AVIV UNIV, DEPT IND ENGN, IL-69978 TEL AVIV, ISRAEL

来源：

COMPUTERS & OPERATIONS RESEARCH | 1998年 / 25卷 / 01期

关键词：

D O I：

10.1016/S0305-0548(97)00033-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The n-job, two-machine, multi-robot flowshop scheduling problem is considered with the objective of minimizing makespan. Various transportation, setup and loading/unloading effects arising in a modem flexible manufacturing cell are modeled by a graph representation of the technological process. An algorithm of O(n(2)) complexity is derived to solve the problem to optimality. (C) 1997 Elsevier Science Ltd.

引用

页码：53 / 62

页数：10

共 12 条

[1]

BELENKII AS, 1989, AUTOMAT REM CONTR+, V50, P1

[2] 2-MACHINE FLOWSHOP SEQUENCING WITH SPARSE PRECEDENCE CONSTRAINTS [J].

GIM, BJ ;

CURRY, GL ;

DEUERMEYER, BL .

COMPUTERS & INDUSTRIAL ENGINEERING, 1994, 26 (01) :173-180

[3]

Johnson S.M., 1954, NAV RES LOG, V1, P61, DOI DOI 10.1002/NAV.3800010110

[4] AUTOMATED 2-MACHINE FLOWSHOP SCHEDULING - A SOLVABLE CASE [J].

KISE, H ;

SHIOYAMA, T ;

IBARAKI, T .

IIE TRANSACTIONS, 1991, 23 (01) :10-16

[5] 2-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS [J].

KURISU, T .

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1977, 20 (02) :113-131

[6]

Lawler E. L., 1993, HDB OPERATIONS RES M, V4

[7]

LEVIN MS, 1978, AUTOMAT REM CONTR+, V39, P1497

[8]

LEVNER E, 1995, J OPER RES SOC, V46, P1447

[9] SCHEDULING A 2-MACHINE ROBOTIC CELL - A SOLVABLE CASE [J].

LEVNER, E ;

KOGAN, K ;

LEVIN, I .

ANNALS OF OPERATIONS RESEARCH, 1995, 57 :217-232

[10]

MITTEN LG, 1959, J IND ENG, V10, P131

← 1 2 →