A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems

被引：30

作者：

Averbakh, I ^{[1
]}

Berman, O

机构：

[1] Western Washington Univ, Bellingham, WA 98225 USA

[2] Univ Toronto, Toronto, ON, Canada

来源：

OPERATIONS RESEARCH | 1999年 / 47卷 / 01期

关键词：

D O I：

10.1287/opre.47.1.165

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the routing-scheduling version of the flow-shop problem, where n jobs located at different nodes of a transportation network must be executed by m machines (servers) travelling between the jobs,The objective is to minimize the makespan. For this problem, we present a simple heuristic and analyze its worst-case performance.

引用

页码：165 / 170

页数：6

共 18 条

[1] SALES-DELIVERY MAN PROBLEMS ON TREE-LIKE NETWORKS [J].

AVERBAKH, I ;

BERMAN, O .

NETWORKS, 1995, 25 (02) :45-58

[2]

Blazewicz J., 1991, International Journal of Flexible Manufacturing Systems, V4, P5, DOI 10.1007/BF01325094

[3]

Christofides N., 1976, tech. rep.

[4]

DESROSIERS J, 1992, G9242 GERAD

[5] THE DELIVERY MAN PROBLEM AND CUMULATIVE MATROIDS [J].

FISCHETTI, M ;

LAPORTE, G ;

MARTELLO, S .

OPERATIONS RESEARCH, 1993, 41 (06) :1055-1064

[6]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[7] FLOW-SHOP AND JOB-SHOP SCHEDULES - COMPLEXITY AND APPROXIMATION [J].

GONZALEZ, T ;

SAHNI, S .

OPERATIONS RESEARCH, 1978, 26 (01) :36-52

[8]

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

[9] ROBOT TASK-SCHEDULING IN A FLEXIBLE MANUFACTURING CELL [J].

KING, RE ;

HODGSON, TJ ;

CHAFEE, FW .

IIE TRANSACTIONS, 1993, 25 (02) :80-87

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

KISE, H ;

SHIOYAMA, T ;

IBARAKI, T .

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

← 1 2 →