Abstract
In this paper, the flow-shop sequence-dependent group scheduling (FSDGS) problem is addressed with reference to the makespan minimization objective. In order to effectively cope with the issue at hand, a hybrid metaheuristic procedure integrating features from genetic algorithms and random sampling search methods has been developed. The proposed technique makes use of a matrix encoding able to simultaneously manage the sequence of jobs within each group and the sequence of groups to be processed along the flow-shop manufacturing system. A well-known problem benchmark arisen from literature, made by two, three and six-machine instances has been taken as reference for both tuning the relevant parameters of the proposed procedure and assessing performances of such approach against the two most recent algorithms presented in the body of literature addressing the FSDGS issue. The obtained results, also supported by a properly developed ANOVA analysis, demonstrate the superiority of the proposed hybrid metaheuristic in tackling the FSDGS problem under investigation.
Similar content being viewed by others
References
Allahverdi, A., Gupta, J. N. D., & Aldowaisian, T. (1999). A review of scheduling research involving setup considerations. OMEGA, The International Journal of Management and Science, 27(2), 219–239.
Baker, K. R., & Trietsch, D. (2009). Principles of sequencing and scheduling. Hoboken, NJ: Wiley.
Baykasoglu, A. (2004). A metaheuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting numbers of cells. Journal of Intelligent Manufacturing, 15, 753–759.
Celano, G., Costa, A., & Fichera, S. (2010). Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times. The International Journal of Advanced Manufacturing Technology, 46(5–8), 695–705.
Cheng, T. C. E., Gupta, J. N. D., & Wang, G. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management, 9(3), 262–282.
Costa, A., Cappadonna, F. A., & Fichera, S. (2013). A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem. Computers & Industrial Engineering, 64(4), 937–958.
Crepinsek, M., Liu, S. H., & Mernik, M. (2013). Exploration and exploitation in evolutionary algorithms: A survey. ACM Computing Surveys, 45(3), art. 35.
França, P. M., Gupta, J. N. D., Mendes, A. S., Moscato, P., & Veltink, K. J. (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers & Industrial Engineering, 48(3), 491–506.
Gallagher, C. C., & Knight, W. A. (1986). Group technology production methods in manufacturing. England: Ellis Horwood Limited.
Gao, J., Gen, M., & Sun, L. (2006). Scheduling jobs and maintenance in flexible job shop with a hybrid genetic algorithm. Journal of Intelligent Manufacturing, 17(4), 493–507.
Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization (engineering design and automation). NY: Wiley.
Hajinejad, D., Salmasi, N., & Mokhtari, R. (2011). A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem. Scientia Iranica, 18(3), 759–764.
Ham, I., Hitomi, K., & Yoshida, T. (1985). Group technology: Applications to production management. Hingham, MA: Kluwer.
Hendizadeh, H., Faramarzi, H., Mansouri, S. A., Gupta, J. N. D., & ElMekkawy, T. Y. (2008). Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics, 111(2), 593–605.
Hitomi, K., & Ham, I. (1976). Operations scheduling for group technology applications. Annals of CIRP, 25, 419–422.
Hyer, N. L., & Wemmerloev, U. (1989). Group technology in the US manufacturing industry: A survey of current practices. International Journal of Production Research, 27, 1287–1304.
Kim, K. W., Gen, M., & Yamazaki, G. (2003). Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling. Applied Soft Computing, 2(3), 174–188.
Lin, H. T., & Liao, C. J. (2003). A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics, 86(2), 133–143.
Logendran, R., & Sriskandarajah, C. (1993). Two-machine group scheduling problem with blocking and anticipatory setups. European Journal of Operational Research, Special Issue on Cellular Manufacturing Systems, 69(3), 467–481.
Logendran, R., Mai, L., & Talkington, D. (1995). Combined heuristics for bi-level group scheduling problems. International Journal of Production Economics, 38(2–3), 133–145.
Logendran, R., & Sirikrai, V. (2000). Machine duplication and part subcontracting in the presence of alternative cell locations in manufacturing cell design. Journal of the Operational Research Society, 51, 609–624.
Logendran, R., Salmasi, N., & Sriskandarajah, C. (2006). Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups. Computers & Operations Research, 33(1), 158–180.
Luo, H., Zhang, A., & Huang, G. Q. (2013). Active scheduling for hybrid flowshop with family setup time and inconsistent family formation. Journal of Intelligent Manufacturing (in press). doi:10.1007/s10845-013-0771-9
Mahmoodi, F., & Dooley, K. J. (1991). A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell. International Journal of Production Research, 29, 1923–1939.
Marinakis, Y., & Marinaki, M. (2013). Combinatorial neighbourhood topology particle swarm optimization algorithm for the vehicle routing problem. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, 7832, 133–144.
Meeran, S., & Morshed, M. S. (2012). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: A case study. Journal of Intelligent Manufacturing, 23(4), 1063–1078.
Michalewicz, Z. (1994). Genetic algorithms + data structures = evolution programs (2nd ed.). Berlin: Springer.
Montgomery, D. C. (2008). Design and analysis of experiments (7th ed.). Hoboken, NJ: Wiley.
Naderi, B., & Salmasi, N. (2012). Permutation flowshops in group scheduling with sequence-dependent setup times. European Journal of Industrial Engineering, 6(2), 177–198.
Nawaz, M., Enscore, E. E, Jr, & Ham, I. (1983). A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. OMEGA, The International Journal of Management and Science, 11(1), 91–95.
Paredes, F., Suresh, N. C., & Kay, J. M. (1998). Group technology and cellular manufacturing: A state-of-the-art synthesis of research and practice. Boston: Kluwer.
Pinedo, M. L. (2012). Scheduling: Theory, algorithms and systems (4th ed.). New York, NY: Springer.
Salmasi, N., & Logendran, R. (2008). A heuristic approach for multi-stage sequence-dependent group scheduling problems. Journal of Industrial Engineering International, 4(7), 48–58.
Salmasi, N., Logendran, R., & Skandari, M. R. (2010). Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Computers & Operations Research, 37(1), 199–212.
Salmasi, N., Logendran, R., & Skandari, M. R. (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. The International Journal of Advanced Manufacturing Technology, 56, 699–710.
Schaller, J. E., Gupta, J. N. D., & Vakharia, A. J. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125(2), 324–339.
Schaller, J. (2001). A new lower bound for the flow shop group scheduling problem. Computers & Industrial Engineering, 41, 151–161.
Shankar, R., & Vrat, P. (1999). Some design issues in cellular manufacturing using the fuzzy programming approach. International Journal of Production Research, 37, 2545–2563.
Soleymanpour, M., Vrat, P., & Shankar, R. (2002). A transiently chaotic neural network approach to the design of cellular manufacturing. International Journal of Production Research, 40, 2225–2244.
Yu, C., Ji, Y., Qi, G., Gu, X., & Tao, L. (2013). Group-based production scheduling for make-to-order production. doi:10.1007/s10845-013-0817-z.
Zandieh, M., & Karimi, N. (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22, 979–989.
Zhu, X., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setups: A literature review. IIE Transactions, 38(11), 987–1007.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Costa, A., Cappadonna, F.A. & Fichera, S. A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. J Intell Manuf 28, 1269–1283 (2017). https://doi.org/10.1007/s10845-015-1049-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-015-1049-1