Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling

被引：89

作者：

Xing, Li-Ning ^{[1
]}

Chen, Ying-Wu ^{[1
]}

Yang, Ke-Wei ^{[1
]}

机构：

[1] Natl Univ Def Technol, Dept Management Sci & Engn, Coll Informat Syst & Management, Changsha 410073, Hunan, Peoples R China

来源：

APPLIED SOFT COMPUTING | 2009年 / 9卷 / 01期

关键词：

Simulation modeling; Combinatorial optimization; Flexible job shop scheduling; Ant colony optimization; Multi-objective optimization; Scheduling knowledge; ANT COLONY OPTIMIZATION; HYBRID GENETIC ALGORITHM; TABU SEARCH; SHIFTING BOTTLENECK; TARDINESS; TIMES; ACO;

D O I：

10.1016/j.asoc.2008.04.013

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Flexible job shop schedule is very important in both fields of combinatorial optimization and production management. In this paper, a simulation model is presented to solve the multi-objective flexible job shop scheduling problem. The proposed model has been coded by Matlab which is a special mathematical computation language. After modeling the pending problem, the model is validated by five representative instances based on practical data. The results obtained from the computational study have shown that the proposed approach is a feasible and effective approach for the multi-objective flexible job shop scheduling problem. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：362 / 376

页数：15

共 47 条

[1]

[Anonymous], COMPUTING

[2] A heuristic for job shop scheduling to minimize total weighted tardiness [J].

Asano, M ;

Ohta, H .

COMPUTERS & INDUSTRIAL ENGINEERING, 2002, 42 (2-4) :137-147

[3]

Bauer A., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1445, DOI 10.1109/CEC.1999.782653

[4] Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling [J].

Blum, C .

COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) :1565-1591

[5]

Blum C., 2004, J MATH MODELLING ALG, V3, P285, DOI DOI 10.1023/B:JMMA.0000038614.39977.6F

[6]

Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073

[7] An improved ant system algorithm for the vehicle routing problem [J].

Bullnheimer, B ;

Hartl, RF ;

Strauss, C .

ANNALS OF OPERATIONS RESEARCH, 1999, 89 (0) :319-328

[8] An alternative framework to Lagrangian relaxation approach for job shop scheduling [J].

Chen, HX ;

Luh, PB .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (03) :499-512

[9]

Colorni A., 1994, JORBEL-Belgian J. Oper. Res. Stat. Comput. Sci, V34, P39

[10] An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].

DauzerePeres, S ;

Paulli, J .

ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306

← 1 2 3 4 5 →