Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

Parinya Kaweegitbundit

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

Paper Titles

The Characteristics of Flow Boiling Heat Transfer and Pressure Drop in Small Tube with the Pipe Sections Having Increased Diameters
p.525

Application of a Newly Developed Thermally Induced Volumetric Error Compensation Model in Improving Dimensional Accuracy of Parts
p.530

The Research and Design of Portable ECG Acquisition Device Based on Bluetooth and 3G
p.538

Strength Analysis for Lifting Mechanism of Dump Truck Based on Virtual Prototype and Finite Element Technology
p.543

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines
p.548

Exploration of the Hakka Traditional Ware Design From Product View
p.553

The Research of Product Innovative Design Methodology-The Exploration and Practice of Interesting Design
p.559

Computer Aided Form Design Based on Multi-Channel Deformation Technology
p.564

Research on Product Identity Design Based on Kansei Image in Mechanic Equipment
p.569

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 651Memetic Algorithm Approach to Two-Stage Hybrid...

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

Abstract:

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 651)

Pages:

548-552

DOI:

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

Citation:

Cite this paper

Online since:

January 2013

Authors:

Parinya Kaweegitbundit

Keywords:

Hybrid Flow Shop, Identical Parallel Machines, Memetic, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. L. Pinedo. Scheduling: Theory, Algorithm, and System 3rd Edition. New York: Springer Science and Business Media. (2008).

Google Scholar

[2] W. P. Syam and I. M. Al-Harkan. Comparison of Three Meta Heuristic to Optimize Hybrid Flow Shop Scheduling Problem with Parallel Machines. World Academy of Science, Engineering and Technology. Vol. 62 (2010), pp.271-278.

Google Scholar

[3] O. Engin and A. Döyen. A new approach to solve hybrid ﬂow shop scheduling problems by artiﬁcial immune system. Future Generation Computer Systems. Vol. 20 (2004), p.1083–1095.

DOI: 10.1016/j.future.2004.03.014

Google Scholar

[4] F. Choong, S. Phon-Amnuaisuk and M.Y. Alias. Metaheuristic methods in hybrid ﬂow shop scheduling problem. Expert Systems with Applications. Vol. 38 (2011), p.10787–10793.

DOI: 10.1016/j.eswa.2011.01.173

Google Scholar

[5] O. Engin, G. Ceran, M.K. Yilmaz. An efﬁcient genetic algorithm for hybrid ﬂow shop cheduling with multiprocessor task problems. Applied Soft Computing. Vol. 11 (2011), p.3056–3065.

DOI: 10.1016/j.asoc.2010.12.006

Google Scholar

[6] C. Oguz, A. Janiak and M. Lichtenstein. Metaheuristic Algorithms for Hybrid Flow-Shop Scheduling Problem with Multiprocessor Tasks. Proceeding of the 4th Metaheuristics International Conference (MIC 2001), Porto, Portugal, July 16-20 (2001).

Google Scholar

[7] M. Akhshabi, M. Akhshabi and J. Khalatbari. A Memetic Algorithm for Hybrid Flow Shop Scheduling with Multiprocessor Task Problems. Journal of Basic and Applied Scientific Research (2011). Vol. 1(12) pp.3053-3057.

Google Scholar

[8] M. Akhshabi, S.M. Taghavifard and M. Akhshabi. Hybrid flow shop scheduling problem with set up depend sequence with respect to PM. Indian Journal of Fundamental and Applied Life Sciences (2012). Vol. 2 (2) pp.244-250.

Google Scholar

[9] S.H. Abyaneh and M. Zandieh. Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. International Journal of Advanced Manufacturing Technology (2012). Vol. 58 p.309–325.

DOI: 10.1007/s00170-011-3368-5

Google Scholar

[10] J.N.D. Gupta and E.A. Tunc. Schedules for a two-stage hybrid ﬂowshop with parallel machines at the second stage. International Journal of Production Research(1991). Vol. 29 p.1489–1502.

DOI: 10.1080/00207549108948025

Google Scholar

[11] J.N.D. Gupta, A.M.A. Hariri and C.N. Potts. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research (1997). Vol. 69 p.171–191.

Google Scholar

[12] J. Chang, W. Yan, H. Shao. Scheduling a two-stage no-wait hybrid flow shop with separated setup and removal times. Proc. of the 2004 American Control Conference. Boston. (2004), pp.1412-1416.

DOI: 10.23919/acc.2004.1386773

Google Scholar