Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

Parinya Kaweegitbundit

doi:10.4028/www.scientific.net/AMR.339.332

Paper Titles

Synthesis and Crystal Structure of a Cadmium(II) Complex with 2-(4΄-Chlorine-Benzoyl)-Benzoic Acid and 1,10-Phenanthroline
p.313

Ferrocene-Based Antibacterial Agents: Synthesis, Characterization, and Biological Evaluation of Metal (II) Complexes with Glycine-Derived Compounds
p.317

Multiple-Response Surface Approach: Modeling and Optimization
p.321

Effect of Chemical Pretreatment on Cotton Stalk SCMP Bleaching Properties
p.326

Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time
p.332

Forest Biomass Estimation Based on Remote Sensing Method for North Daxingan Mountains
p.336

Failure Analysis on a Counterweight Assembly of an Aeroengine
p.342

Business Excellence Measurement of Supply Chains Based on Collaboration Degree and Service Level
p.349

Thermal Elastoplastic Behavior of Dispersion Nuclear Fuel Elements
p.353

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 339Comparison of Heuristic for Flow Shop Scheduling...

Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

Abstract:

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.

You might also be interested in these eBooks

Advanced Manufacturing Systems, ICMPMT 2011

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 339)

Pages:

332-335

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.339.332

Citation:

Cite this paper

Online since:

September 2011

Authors:

Parinya Kaweegitbundit

Keywords:

Flow Shop, Heuristic, Sequence-Dependent Setup Time

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M.R. Garey, D.S. Johnson and R. Sethi: The complexity of flow shop and job shop scheduling. Math Oper Res. Vol. 1 (1976), pp.117-129

Google Scholar

[2] M. Nawaz, E.E. Enscore and I. Ham: A heuristic algorithm for m-machine, n-job flow shop sequencing problem. OMEGA, Int J Man Sci. Vol. 11 (1983)

DOI: 10.1016/0305-0483(83)90088-9

Google Scholar

[3] C.L. Chen, V.S. Vempati and N. Aljaber: An application of genetic algorithm for flow shop problems. Euro J Oper Res. Vol. 80 (1995), pp.389-396

DOI: 10.1016/0377-2217(93)e0228-p

Google Scholar

[4] S.H. Yoon and J.A. Ventura: An application for class of single machine weight earliness and tardiness problem. Euro J Oper Res. Vol. 52 (2002), pp.167-178

Google Scholar

[5] M. Gholami, M. Zendieh and A. Alem-Tabriz: Scheduling hybrid flow shop with sequence dependent setup times and machines with random breakdowns. Int J Adv Manuf Technol (2009). Vol. 42, pp.189-201

DOI: 10.1007/s00170-008-1577-3

Google Scholar

[6] J.U. Sun: Sequencing problem in two machine flow shop with sequence dependent setup times. EABR&ETLC Conference Proceedings. (2010), pp.519-525

Google Scholar

[7] P. Garg: A comparison between memetic algorithm and genetic algorithm for the cryptanalysis of simplified data encryption standard algorithm. Int J Net Secu & its App. Vol. 1(2009), pp.34-42

Google Scholar