HEURISTICS FOR SCHEDULING FLEXIBLE FLOW LINES

被引：23

作者：

DING, FY

KITTICHARTPHAYAK, D

机构：

[1] Department of Industrial Engineering and Management, North Dakota State University, Fargo

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1994年 / 26卷 / 01期

关键词：

D O I：

10.1016/0360-8352(94)90025-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The scheduling problem of a flow shop with parallel machines at each stage is an extension of the well known single-line flow shop problem. The purpose of this paper is to present heuristics for solving such flow shop scheduling problems in which parallel machines are assumed. Three heuristics are given in this paper. The computational results show that a combined approach solved the problem quite effectively.

引用

页码：27 / 34

页数：8

共 17 条

[1]

ARTHANARI TS, 1974, THESIS INDIAN STATIS

[2]

BRAH SA, 1991, EUR J OPT RES, V51

[3]

BRAH SA, 1987, OPTIMAL SCHEDULING M

[4]

CAMPBELL HG, 1970, MGMT SCI, V16

[5]

Gary M.R., 1976, MATH OPER RES, V1, P117

[6]

Gupta J. N. D., 1972, AIIE T, V4, P11, DOI DOI 10.1080/05695557208974823

[7]

Gupta Jatinder N. D., 1971, AIIE T, V3, P199

[8] THE 2-MACHINE SEQUENCE DEPENDENT FLOWSHOP SCHEDULING PROBLEM [J].

GUPTA, JND ;

DARROW, WP .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (03) :439-446

[9]

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

[10]

Karp R. M., 1975, Networks, V5, P45

← 1 2 →