Open Access Open Access  Restricted Access Subscription or Fee Access

Application of Meta-Heuristics for Minimization of Makespan in Multi-Stage Hybrid Flow Shop Scheduling Problems with Missing Operations


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/ireme.v8i5.3296

Abstract


A multi-stage Hybrid Flow Shop (HFS) scheduling is characterized ‘n’ jobs ‘m’ machines with ‘M’ stages in series with unidirectional flow of work with a variety of jobs being processed sequentially in a single-pass manner. Most real world scheduling problems are NP-hard in nature. The essential complexity of the problem necessitates the use of meta-heuristics for solving hybrid flow shop scheduling problem. The paper addresses multi-stage hybrid flow shop scheduling problems with missing operations to minimize the makespan time with the specific batch size using Genetic Algorithm (GA) and Simulated Annealing algorithm (SA). It is observed that the GA algorithm yields good quality solutions than SA with lesser computational time.
Copyright © 2014 Praise Worthy Prize - All rights reserved.

Keywords


Hybrid Flow Shop; Makespan; Genetic Algorithm; Simulated Annealing Algorithm

Full Text:

PDF


References


F. S. Serifoglu, G. Ulusoy, Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach, Journal of the Operational Research Society, Vol. 55, no. 5, pp. 504–512, 2004.
http://dx.doi.org/10.1057/palgrave.jors.2601716

C. Oguz, M. Ercan, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Journal of Scheduling, Vol. 8, no. 4, pp. 323–351, 2005.
http://dx.doi.org/10.1007/s10951-005-1640-y

R. Ruiz, C. Maroto, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, European Journal of Operational Research, Vol. 169, no. 3, pp. 781–800, 2006.
http://dx.doi.org/10.1016/j.ejor.2004.06.038

E. Figielska, Heuristic algorithms for preemptive scheduling in a two-stage hybrid flow shop with additional renewable resources at each stage, Computers & Industrial Engineering, Vol. 59, no. 4, pp. 509-519, 2010.
http://dx.doi.org/10.1016/j.cie.2010.06.006

V. Yaurima, L. Burtseva, A. Tchernykh, Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers, Computers and Industrial Engineering, Vol. 56, no. 4, pp. 1452–1463, 2009.
http://dx.doi.org/10.1016/j.cie.2008.09.004

F. Dugardin, F. Yalaoui, L. Amodeo, New multi-objective method to solve reentrant hybrid flow shop scheduling problem, European Journal of Operational Research, Vol. 203, no. 1, pp. 22-31, 2010.
http://dx.doi.org/10.1016/j.ejor.2009.06.031

E. Rashidi, M. Jahandar, M. Zandieh, An improved hybrid multi- objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines, International Journal of Advanced Manufacturing Technology, Vol. 49, no. 9-12, pp. 1129 – 1139, 2010.
http://dx.doi.org/10.1007/s00170-009-2475-z

Vangeri, A., Hebbal, S.S., Route optimization of automated warehouse with the aid of modified genetic algorithms (MGA), (2014) International Review of Mechanical Engineering (IREME), 8 (4), pp. 667-679.

Vasundara, M., Padmanaban, K.P., Ramachandran, T., Saravanan, M., Prediction of machining fixture layout through FEM and ANN and comparison of optimal fixture layouts of GA and ACA, (2014) International Review of Mechanical Engineering (IREME), 8 (3), pp. 537-546.

Ramesh, K., Baskar, N., Pandianathan, A., Optimization of Sheet Metal Parts Nesting using Genetic Algorithm, (2014) International Review of Mechanical Engineering (IREME), 8 (4), pp. 810-815.

K. Chakravarthy, C. Rajendran, A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization, Production Planning & Control, Vol. 10, No. 7, pp.707 –714, 1999.
http://dx.doi.org/10.1080/095372899232777

S. M. Mousavi, M. J. Zandieh, M. R. Yazdani, A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flow shop, International Journal of Advanced Manufacturing Technology, Vol. 64, no. 1- 4, pp. 369-388, 2013.
http://dx.doi.org/10.1007/s00170-012-4031-5

F. Jolai, H. Asefi, M. Rabiee, P. Ramezani, Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem, Scientia Iranica, Vol. 20, no. 3, 2013.

H. S. Mirsanei, M. Zandieh, M. J. Moayed M. R. Khabbazi, A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times, Journal of Intelligent Manufacturing, Vol. 22, pp. 965–978, 2011.
http://dx.doi.org/10.1007/s10845-009-0373-8

H. M. Wang, F. D. Chou, F.C. Wu, A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan, International Journal of Advanced Manufacturing Technology, Vol. 53, pp. 761–776, 2011.
http://dx.doi.org/10.1007/s00170-010-2868-z

A. Dhingra, P. Chandna, Multi-objective flow shop scheduling using hybrid simulated annealing, Measuring Business Excellence, Vol. 14, no. 3, pp.30 – 41, 2010.
http://dx.doi.org/10.1108/13683041011074191

S. Tianping, Y. U. Jinguo, S. Ling, A simulated annealing algorithm for the hybrid flow shop scheduling to minimize the number of tardy jobs, OR Transactions, Vol. 17, no. 2, pp. 41-47, 2013.

R. Ruiz; J. A.Vazquez-Rodriguez, Invited Review: The hybrid flow shop scheduling problem, European Journal of Operational Research, Vol. 205, no. 1–18, 2010
http://dx.doi.org/10.1016/j.ejor.2009.09.024

C. T. Tsenga, C. J. Liao, T. X. Liao, A note on two-stage hybrid flow shop scheduling with missing operations, Computers and Industrial Engineering, Vol. 54, no. 3, pp. 695–704, 2008.
http://dx.doi.org/10.1016/j.cie.2007.09.005

S. Sridhar, T. Prabaharan, M. Saravanan, Optimisation of sequencing and scheduling in hybrid flow shop environment using heuristic approach, International Journal of Logistics Economics and Globalisation, Vol. 2, no. 4, pp. 331–351, 2010.
http://dx.doi.org/10.1504/ijleg.2010.037520

M. K. Marichelvam, T. Prabhaharan, Performance evaluation of an improved hybrid genetic scatter search (IHGSS) algorithm for multistage hybrid flow shop scheduling problems with missing operations, International Journal of Industrial and Systems Engineering, Vol. 16, no. 1, pp. 120-141, 2014.
http://dx.doi.org/10.1504/ijise.2014.057946

J. Holland, Adaptation in natural and artificial systems: Ann Arbor, The University of Michigan press, 1975.
http://dx.doi.org/10.1016/s0092-8240(76)80036-5

S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science, Vol. 220, no. 4598, pp. 671-680, 1983.
http://dx.doi.org/10.1126/science.220.4598.671

Kahrom, M., Mohammad Javadi, S., Haghparast, P., Application of multi objective genetic algorithm to optimize heat transfer enhancement from a flat plate, (2010) International Review of Mechanical Engineering (IREME), 4 (2), pp. 167-175.
http://dx.doi.org/10.5829/idosi.ije.2012.25.01c.08

Marcelin, J.-L., Optimization of the boundary conditions by genetic algorithms, (2012) International Review of Mechanical Engineering (IREME), 6 (1), pp. 50-54.

Omar, H.M., Developing geno-fuzzy controller for satellite stabilization with gravity gradient, (2014) International Review of Aerospace Engineering, 7 (1), pp. 8-16.

Dhavamani, C., Alwarsamy, T., Optimization of cutting parameters for aluminum and silicon carbide composite using taguchi's techniques, (2012) International Review of Mechanical Engineering (IREME), 6 (6), pp. 1361-1365.
http://dx.doi.org/10.1016/j.proeng.2012.06.241

Golshan, F., Mohammadi, K., Evolutionary-generated watermark for robust digital image watermarking in DCT_SVD domain, (2011) International Review on Computers and Software (IRECOS), 6 (2), pp. 155-161.

Alsous, E., Nezam, F., Monadjemi, S.A., Neamatbakhsh, N., A novel GA based approach to Farsi and Arabic signature verification, (2010) International Review on Computers and Software (IRECOS), 5 (1), pp. 44-51.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize