{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:55:37Z","timestamp":1780959337367,"version":"3.54.1"},"reference-count":36,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS) problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs) and Biased Random Sampling (BRS) search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.<\/jats:p>","DOI":"10.3390\/a7030376","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T11:33:53Z","timestamp":1405337633000},"page":"376-396","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Hybrid Metaheuristic Approach for Minimizing  the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem"],"prefix":"10.3390","volume":"7","author":[{"given":"Antonio","family":"Costa","sequence":"first","affiliation":[{"name":"University of Catania, DII, V.le A. Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fulvio","family":"Cappadonna","sequence":"additional","affiliation":[{"name":"University of Catania, DIEEI, V.le A. Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergio","family":"Fichera","sequence":"additional","affiliation":[{"name":"University of Catania, DII, V.le A. Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0278-6125(87)90035-5","article-title":"Efficient solving of the group technology problem","volume":"6","author":"Kusiak","year":"1987","journal-title":"J. Manuf. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2545","DOI":"10.1080\/002075499190653","article-title":"Some design issues in cellular manufacturing using the fuzzy programming approach","volume":"37","author":"Shanker","year":"1999","journal-title":"Int. J. Prod. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.ejor.2007.09.023","article-title":"Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration","volume":"192","author":"Bulgak","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","unstructured":"Gallagher, C.C., and Knight, W.A. (1986). Group Technology Production Methods in Manufacturing, Ellis Horwood Limited."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0272-6963(86)90021-5","article-title":"Procedures for the part family\/machine group identification problem in cellular manufacturing","volume":"6","author":"Wemmerlov","year":"1986","journal-title":"J. Oper. Manag."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0360-8352(01)00049-3","article-title":"A new lower bound for the flow shop group scheduling problem","volume":"41","author":"Schaller","year":"2001","journal-title":"Comput. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1016\/j.cor.2010.02.007","article-title":"An ant colony optimization heuristic for machine-part cell formation problems","volume":"37","author":"Li","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1016\/j.eswa.2009.08.012","article-title":"Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system","volume":"37","author":"Javadian","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Ham, I., Hitomi, K., and Yoshida, T. (1985). Group Technology: Applications to Production Management, Kluwer Academic Publishers.","DOI":"10.1007\/978-94-009-4976-8"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/0377-2217(93)90029-M","article-title":"Two-machine group scheduling problem with blocking and anticipatory setups","volume":"69","author":"Logendran","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0925-5273(94)00083-M","article-title":"Combined heuristics for bi-level group scheduling problems","volume":"38","author":"Logendran","year":"1995","journal-title":"Int. J. Prod. Econ."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Pinedo, M. (2012). Scheduling: Theory, Algorithms and Systems,, Springer. [4th ed.].","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.rcim.2004.07.002","article-title":"Scheduling non-similar groups on a flow line: Multiple group setups","volume":"20","author":"Wilson","year":"2004","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cor.2009.04.013","article-title":"Total flow time minimization in a flowshop sequence-dependent group scheduling problem","volume":"37","author":"Salmasi","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"OMEGA Int. J. Manag. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.2000.tb00137.x","article-title":"A review of flowshop scheduling research with setup times","volume":"9","author":"Cheng","year":"2000","journal-title":"Prod. Oper. Manag."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408170600559706","article-title":"Scheduling and lot sizing with sequence-dependent setups: A literature review","volume":"38","author":"Zhu","year":"2006","journal-title":"IIE Trans."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","article-title":"Scheduling a flowline manufacturing cell with sequence dependent family setup times","volume":"125","author":"Schaller","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","article-title":"Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups","volume":"48","author":"Gupta","year":"2005","journal-title":"Comput. Ind. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.cor.2004.07.004","article-title":"Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups","volume":"33","author":"Logendran","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ijpe.2007.02.031","article-title":"Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times","volume":"111","author":"Hendizadeh","year":"2008","journal-title":"Int. J. Prod. Econ."},{"key":"ref_22","first-page":"48","article-title":"A heuristic approach for multi-stage sequence-dependent group scheduling problems","volume":"4","author":"Salmasi","year":"2008","journal-title":"J. Ind. Eng. Inter."},{"key":"ref_23","unstructured":"Salmasi, N. (2005). Multi-Stage Group Scheduling Problems with Sequence Dependent Set-Ups. [Doctoral Dissertation, Oregon State University]."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s00170-009-2112-x","article-title":"Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times","volume":"46","author":"Celano","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1993","journal-title":"OMEGA Int. J. Manag. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-011-3206-9","article-title":"Makespan minimization of a flowshop sequence-dependent group scheduling problem","volume":"56","author":"Salmasi","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.scient.2011.05.023","article-title":"A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem","volume":"18","author":"Hajinejad","year":"2011","journal-title":"Sci. Iran."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1504\/EJIE.2012.045604","article-title":"Permutation flowshops in group scheduling with sequence-dependent setup times","volume":"6","author":"Naderi","year":"2012","journal-title":"Eur. J. Ind. Eng."},{"key":"ref_29","first-page":"221","article-title":"A genetic algorithm for scheduling both job families and skilled workforce","volume":"19","author":"Costa","year":"2013","journal-title":"Int. J. Oper. Quant. Manag."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1080\/00207543.2014.883469","article-title":"Joint optimization of a flow-shop group scheduling with sequence dependent set-up times and skilled workforce assignment","volume":"52","author":"Costa","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1007\/s00170-013-5221-5","article-title":"A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times","volume":"69","author":"Costa","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (1994). Genetic Algorithms + Data Structures = Evolution Programs, Springer. [2nd ed.].","DOI":"10.1007\/978-3-662-07418-3"},{"key":"ref_33","unstructured":"Davis, L. (1991). Handbook of Genetic Algorithms, Van Nostrand Reinhold."},{"key":"ref_34","unstructured":"Davis, L. (1985, January 18\u201323). Applying Adaptive Algorithms to Epistatic Domains. Proceedings of the International Joint Conference on Artificial Intelligence, Los Angeles, CA, USA."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Baker, K.R., and Trietsch, D. (2009). Principles of Sequencing and Scheduling, John Wiley & Sons.","DOI":"10.1002\/9780470451793"},{"key":"ref_36","unstructured":"Montgomery, D.C. (2008). Design and Analysis of Experiments, John Wiley & Sons. [7th ed.]."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/3\/376\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:13:35Z","timestamp":1760217215000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/3\/376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":36,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2014,9]]}},"alternative-id":["a7030376"],"URL":"https:\/\/doi.org\/10.3390\/a7030376","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,14]]}}}