Abstract
This paper deals with hybrid flow shop scheduling problems considering time lags and sequence-dependent setup times which have wide application in real-world problems. Most of the researches on operations scheduling problems have ignored time lags. A mathematical model is presented which is capable of solving the small size of the considered problem in a reasonable time. Since these problems are strongly NP-hard, a meta-heuristic algorithm based on the immune algorithm is developed. The optimization criterion considered in this paper is the minimization of the makespan. Numerical experiments are used to evaluate the performance and effectiveness of the proposed algorithm. The results of the proposed algorithm are compared with the presented mathematical programming model and a benchmark algorithm. Computational results indicate that the proposed algorithm can produce near-optimal solutions in a short computational time. Moreover, it can be applied easily in real factory conditions and for large-sized problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramson N (1963) Information theory and coding. McGraw Hill, New York
Botta-Genoulaz V (2000) Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. Int J Prod Econ 64(1–3):101–111
Caricato P, Grieco A, Serino D (2007) Tsp-based scheduling in a batch-wise hybrid flow-shop. Robot Comput-Integr Manuf 23:234–241
Fattahi P, Jolai F, Arkat J (2009) Flexible job shop scheduling with overlapping in operations. Appl Math Model 33(7):3076–3087
Fondrevelle J, Oulamara A, Portmann MC (2006) Permutation flowshop scheduling problems with maximal and minimal time lags. Comput Oper Res 33(6):1540–1556
Goldberg DE (1953) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading
Hung TSL, Ching JL (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86:133–143
Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371–388
Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1):66–82
Leon VJ, Ramamoorthy B (1997) An adaptable problem-space-based search method for flexible flow line scheduling. IIE Trans 29:115–125
Logendran R, de Szoeke P, Barnard F (2006) Sequence dependent group scheduling problems in flexible flow shops. Int J Prod Econ 102:66–86
Norman BA, Bean JC (1999) A genetic algorithm methodology for complex scheduling problems. Nav Res Logist 46:199–211
Pinedo M (2002) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall, Upper Saddle River
Rios-Mercado RZ, Bard JF (1998) Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput Oper Res 25(5):351–366
Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169:781–800
Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165:34–54
Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180:111–127
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Javadian, N., Fattahi, P., Farahmand-Mehr, M. et al. An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence-dependent setup times. Int J Adv Manuf Technol 63, 337–348 (2012). https://doi.org/10.1007/s00170-012-3911-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-3911-z