Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach

被引:32
作者
Babayan, A [1 ]
He, D [1 ]
机构
[1] Univ Illinois, Dept Mech & Ind Engn, Chicago, IL 60607 USA
关键词
D O I
10.1080/00207540310001602946
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a general methodology of agent- based manufacturing systems scheduling, incorporating game theoretic analysis of agent cooperation is presented to solve the n- job 3- stage. flexible. flowshop scheduling problem. The. flowshops are. flexible in the sense that a job can be processed by any of the identical machines at each stage. Our objective is to schedule a set of n jobs so as to minimize the makespan. We perform error bound analysis using the lower bound estimates developed in the literature as a datum for comparing the agent- based scheduling solutions with other heuristic solutions. The results of the evaluation show that the agent- based scheduling approach outperforms existing heuristics for the majority of the testing problems.
引用
收藏
页码:777 / 799
页数:23
相关论文
共 59 条
[1]  
AMAMRITHAM K, 1984, IEEE SOFTWARE, P65
[2]  
[Anonymous], P 13 INT JOINT C ART
[3]  
[Anonymous], INTELLIGENT SCHEDULI
[4]  
[Anonymous], 1959, CONTRIBUTIONS THEORY
[5]  
BAKER AD, 1991, THESIS RENSSELAER PO
[6]  
BUSSMANN S, 2001, IEEE S EMERGING TECH, V2, P481
[7]  
Butler J., 1992, ARTIF INTELL, P199
[8]  
CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630
[9]   SCHEDULING JOBS WITH RELEASE DATES AND TAILS ON IDENTICAL MACHINES TO MINIMIZE THE MAKESPAN [J].
CARLIER, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) :298-306
[10]   A new heuristic for three-machine flow shop scheduling [J].
Chen, B ;
Glass, CA ;
Potts, CN ;
Strusevich, VA .
OPERATIONS RESEARCH, 1996, 44 (06) :891-898