A SIMULATED ANNEALING HEURISTIC FOR SCHEDULING IN A FLOWSHOP WITH BICRITERIA

被引：22

作者：

GANGADHARAN, R

RAJENDRAN, C

机构：

[1] Department of Humanities and Social Sciences, Indian Institute of Technology, Madras

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1994年 / 27卷 / 1-4期

关键词：

FLOWSHOP SCHEDULING; SIMULATED ANNEALING; MAKESPAN; FLOWTIME;

D O I：

10.1016/0360-8352(94)90337-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider the flowshop scheduling problem with the twin-objective of minimizing makespan and total flowtime. We apply the Simulated Annealing (SA) technique to develop the proposed heuristic. Two new heuristics are proposed to provide the seed sequences for the SA heuristic. When compared with the existing heuristics, the proposed SA heuristic is found to perform much better.

引用

页码：473 / 476

页数：4

共 7 条

[1]

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

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