AN EFFICIENT HEURISTIC APPROACH TO THE SCHEDULING OF JOBS IN A FLOWSHOP

被引：28

作者：

RAJENDRAN, C

CHAUDHURI, D

机构：

[1] Division of Industrial Engineering and Management, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 61卷 / 03期

关键词：

FLOWSHOP SCHEDULING; HEURISTICS; TOTAL FLOWTIME;

D O I：

10.1016/0377-2217(92)90361-C

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Three heuristic algorithms for flowshop scheduling with the objective of minimizing total flowtime are presented in this paper. Since the flowshop scheduling problem has been found to be an NP-complete problem, the development of heuristic algorithms that guarantee fairly accurate solutions becomes necessary. The proposed algorithms are found to give consistently near-optimal solutions and fare better than the existing methods.

引用

页码：318 / 325

页数：8

共 17 条

[1]

Bansal S. P., 1977, AIIE Transactions, V9, P306, DOI 10.1080/05695557708975160

[2]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

[3]

Conway R, 1967, THEORY SCHEDULING

[4] EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].

DANNENBRING, DG .

MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182

[5]

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

[6]

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

[7] A NEW HEURISTIC FOR THE N-JOB, M-MACHINE FLOWSHOP PROBLEM [J].

HO, JC ;

CHANG, YL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 52 (02) :194-202

[8] AN EXTENSION OF PALMER HEURISTIC FOR THE FLOW-SHOP SCHEDULING PROBLEM [J].

HUNDAL, TS ;

RAJGOPAL, J .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (06) :1119-1124

[9] APPLICATION OF BRANCH AND BOUND TECHNIQUE TO SOME FLOW-SHOP SCHEDULING PROBLEMS [J].

IGNALL, E ;

SCHRAGE, L .

OPERATIONS RESEARCH, 1965, 13 (03) :400-&

[10]

Johnson SM, 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

← 1 2 →