Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times

被引：20

作者：

Cheng, Hui-Miao ^{[2
]}

Ying, Kuo-Ching ^{[1
]}

机构：

[1] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan

[2] China Univ Technol, Dept Informat Management, Taipei, Taiwan

来源：

EXPERT SYSTEMS WITH APPLICATIONS | 2011年 / 38卷 / 12期

关键词：

Scheduling; Flow-line manufacturing cell; Sequence dependent family setups; GROUP SCHEDULING PROBLEMS; SINGLE-MACHINE; COVERING PROBLEMS; PERMUTATION; HEURISTICS; TARDINESS; ALGORITHM; SHOPS;

D O I：

10.1016/j.eswa.2011.06.008

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The flow-line manufacturing cell scheduling problem (FMCSP) with sequence dependent family setup times (SDFSTs) is a topic of great concern for many industrial applications, but under-represented in the research literature. In this study, a two-level iterated greedy (TLIG) heuristic is proposed to minimize makespan of this strongly NP-hard problem. The performance of the proposed TLIG heuristic is compared against eight existing algorithms on a benchmark problem set used in earlier studies. The experimental results reveal that the proposed TLIG heuristic is very effective and efficient at finding near-optimal solutions for FMCSPs with SDFSTs. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：15517 / 15522

页数：6

共 27 条

[1]

Campbell HerbertG., 1970, Management Science, V16, P630, DOI [10.1287/mnsc.16.10.b630, DOI 10.1287/MNSC.16.10.B630]

[2] Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups [J].

França, PM ;

Gupta, JND ;

Mendes, AS ;

Moscato, P ;

Veltink, KJ .

COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (03) :491-506

[3] An evaluation of group scheduling heuristics in a flow-line manufacturing cell [J].

Frazier, GV .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (04) :959-976

[4] Minimizing flow time in a flow-line manufacturing cell with family setup times [J].

Gupta, JND ;

Schaller, JE .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (02) :163-176

[5] Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times [J].

Hendizadeh, S. Hamed ;

Faramarzi, Hamidreza ;

Mansouri, S. Afshin ;

Gupta, Jatinder N. D. ;

ElMekkawy, Tarek Y. .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) :593-605

[6]

JACOBS LW, 1995, NAV RES LOG, V42, P1129, DOI 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO

[7]

2-M

[8] A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date [J].

Lin, Shih-Wei ;

Chou, Shuo-Yan ;

Ying, Kuo-Ching .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (02) :1294-1301

[9] Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times [J].

Lin, Shih-Wei ;

Gupta, Jatinder N. D. ;

Ying, Kuo-Ching ;

Lee, Zne-Jung .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (12) :3205-3217

[10] Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times [J].

Lin, Shih-Wei ;

Ying, Kuo-Ching ;

Lee, Zne-Jung .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (04) :1110-1121

← 1 2 3 →