A Two-Stage Hybrid Algorithm for Flexible Job-Shop Scheduling

Article Preview

Abstract:

A mathematical model was constructed with two objectives. A two-stage hybrid algorithm was developed for solving this problem. At first, the man-hour optimization based on genetic algorithm and dynamic programming method, the model decomposes the flow shop into two layers: sub-layer and patrilineal layer. On the basis of the man-hour optimization,A simulated annealing genetic algorithm was proposed to optimize the sequence of operations. A new selection procedure was proposed and hybrid crossover operators and mutation operators were adopted. A benchmark problem solving result indicates that the proposed algorithm is effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Pages:

476-481

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Norman B A. Scheduling flow-shops with finite buffers and sequence dependent set up times [J]. Computers & Industrial Engineering, 1999, 36: 163-177.

DOI: 10.1016/s0360-8352(99)00007-8

Google Scholar

[2] Brucker P, Heitmann S, Hurink J. Flow-shop problems with intermediate buffers [J]. ORSpectrum, 2003, 25: 549-574.

DOI: 10.1007/s00291-003-0133-7

Google Scholar

[3] Ronconi D P. A note on constructive heuristics for the flow-shop problem with blocking [J]. International Journal of Production Economics, 2004, 87: 39-48.

DOI: 10.1016/s0925-5273(03)00065-3

Google Scholar

[4] Wang Li, Zhen D Z. An effective hybrid heuristic for flow-shop scheduling [J]. International Journal of Advanced Manufacturing Technology, 2003, 21(1): 38-44.

DOI: 10.1007/s001700300005

Google Scholar

[5] Ponnambalam S G, Mohan Reddy M. A GASA multi-objective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling [J]. International Journal of Advanced Manufacturing Technology, 2003, 21: 126-137.

DOI: 10.1007/s001700300015

Google Scholar

[6] Sawik T. Mixed integer programming for scheduling flexible lines with limited intermediate buffers [J]. Mathematical and Computer Modeling. 2000: 31: 39-52.

DOI: 10.1016/s0895-7177(00)00110-2

Google Scholar

[7] Sawik T J. A scheduling algorithm for flexible flow-lines with limited intermediate buffers [J]. Applied Stochastic Models and Data Analysis, 1993 (9): 127-138.

DOI: 10.1002/asm.3150090206

Google Scholar

[8] Liu Bin, Jiang Zhu-hua. The Intelligent Man-Hour Estimate Technique of Assembly for Shipbuilding [J] Journal of shanghai jiaotong university (engineering science), 2005(12): 20-24.

Google Scholar

[9] Wang Xiao-rong, Wu Tie-jun. flexible job-shop scheduling based on petri-net model[J]. Journal of zhejiang university(engineering science), 2004(3): 286-291.

Google Scholar

[10] Wang Bing-gang, Research on Integrated Optimization for Mixed-model Fabrication/assembly Systems [J] Journal of mechanical engineering, 2010(10): 114-120.

Google Scholar