Paper Titles

Velocity Control Method for Continuous Short Line Segment High-Speed Machining Based on Transition of Parametric Spline
p.2407

Research of Sequencing Working Steps Method for Box Part
p.2412

Dynamic Reentrant Scheduling Simulation for Assembly and Test Production Line in Semiconductor Industry
p.2418

The Conjugation of the Hardened and Grinded Worm Gear
p.2423

An Effective Immune Based Approach for the No-Wait Flow Shop Scheduling Problems with Multiple Machines
p.2432

A Production Scheduling Method for Bell-Type Batch Annealing Shop
p.2436

Filtered Beam Search Based Flexible Job Shop Scheduling Problem with Transportation Time
p.2440

A Symbolic OBDD-Based Algorithm for Assembly Sequence Planning
p.2444

An Improved Genetic Algorithm for Multi-Objective Flexible Job-Shop Scheduling Problem
p.2449

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 97-101An Effective Immune Based Approach for the No-Wait...

An Effective Immune Based Approach for the No-Wait Flow Shop Scheduling Problems with Multiple Machines

Article Preview

Abstract:

For scheduling problems, no-wait constraint is an important requirement for many industries. As known, the no-wait scheduling problem is NP-hard and has several practical applications. This paper applies an immune algorithm to solve the multiple-machine no-wait flow shop scheduling problem with minimizing the makespan. Twenty-three benchmark problems on the OR-Library are solved by the immune algorithm. Limited numerical results show that the immune algorithm performs better than the other typical approaches in the literature for most of instances.

You might also be interested in these eBooks

Manufacturing Science and Engineering I

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Pages:

2432-2435

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.97-101.2432

Citation:

Cite this paper

Online since:

March 2010

Authors:

Yi Chih Hsieh, Y.C. Lee, Peng Sheng You, Ta Cheng Chen

Keywords:

Flow Shop Scheduling, Immune Algorithm, No-Wait

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M.R. Garey and D.S. Johnson: Computers and Intractability: a Guide to the Theory of #P-completeness (Freeman, San Francisco 1979).

[2] C. Rajendran: J. Oper. Res. Soc. Vol. 45 (1994), p.472.

[3] N.G. Hall and C. Sriskandarayah: Oper. Res. Vol. 44 (1996), p.510.

[4] J. Grabowski and J. Pempera: Comput. Oper. Res. Vol. 32 (2005), p.2197.

[5] W. Raaymakers and J. Hoogeveen: Eur. J. Oper. Res. Vol. 126 (2000), p.131.

[6] N.G. Hall and C. Sriskandarajah: Oper. Res. Vol. 44 (1996), p.510.

[7] J. Piehler: Unternehmensforschung Vol. 4 (1960), p.138.

[8] S.S. Reddi and C.V. Ramamoorthy: Oper. Res. Quart. Vol. 23 (1972), p.323.

[9] P.C. Gilmore and R.E. Gomory: Oper. Res. Vol. 12 (1964), p.655.

[10] C. Rajendran and D. Chaudhuri: Nav. Res. Log. Vol. 37 (1990) p.695.

[11] T. Aldowaisan and A. Allahverdi: Comput. Oper. Res. Vol. 30 (2003), p.1219.

[12] C.J. Schuster and J.M. Framinan: Oper. Res. Lett. Vol. 31 (2003), p.308.

[13] J. Elmaghraby and J. Kamburowski: Manage. Sci. Vol. 38 (1992), p.1245.

[14] Z. Michalewicz: Genetic Algorithm+Data Structures=Evolution Programs (Springer-Verlag, New York 1994).

[15] C. Reeves: Comput. Oper. Res. Vol. 22 (1995), p.5.

[16] J. Heller: Oper. Res. Vol. 8 (1960), p.178.

[17] C.J. Schuster and J.M. Framinan: Oper. Res. Lett. Vol. 31 (2003), p.308.

[18] Q.K. Pana, M.F. Tasgetirenc and Y.C. Liang: Comput. Oper. Res. Vol. 35 (2008), p.2807.

[19] M. Nawaz, E. Enscore and I. Ham: Omega Vol. 11 (1983), p.91.