{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:00:14Z","timestamp":1767902414358,"version":"3.49.0"},"reference-count":47,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T00:00:00Z","timestamp":1663632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining deterministic setup and processing times. Likewise, several industries present restrictions when changing from one reference to another in the production system, incurring variable and sequence-dependent setup times. Therefore, this article aims to solve the flexible job shop scheduling problem (FJSSP) considering due windows, sequence-dependent setup times, and uncertainty in processing and setup times. A genetic algorithm is proposed to solve the FJSSP by integrating fuzzy logic to minimize the weighted penalties for tardiness\/earliness. The proposed algorithm is implemented in a real-world case study of a fabric finishing production system, and it is compared with four heuristics adapted to the FJSSP such as earliest due date, critical reason, shortest processing time, and Monte Carlo simulation. Results show that the performance of the proposed algorithm provides efficient and satisfactory solutions concerning the objective function and computing time since it overperforms (more than 30%) the heuristics used as benchmarks.<\/jats:p>","DOI":"10.3390\/a15100334","type":"journal-article","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T21:12:53Z","timestamp":1663708373000},"page":"334","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms"],"prefix":"10.3390","volume":"15","author":[{"given":"Emiro Antonio","family":"Campo","sequence":"first","affiliation":[{"name":"Faculty of Economic and Administrative Sciences, Universidad de Medellin, Medellin 050026, Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2638-5581","authenticated-orcid":false,"given":"Jose Alejandro","family":"Cano","sequence":"additional","affiliation":[{"name":"Faculty of Economic and Administrative Sciences, Universidad de Medellin, Medellin 050026, Colombia"}]},{"given":"Rodrigo","family":"G\u00f3mez-Montoya","sequence":"additional","affiliation":[{"name":"Faculty of Administration, Polit\u00e9cnico Colombiano Jaime Isaza Cadavid, Medellin 050022, Colombia"}]},{"given":"Elkin","family":"Rodr\u00edguez-Vel\u00e1squez","sequence":"additional","affiliation":[{"name":"Facultad de Minas, Universidad Nacional de Colombia, Medellin 050034, Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8912-0970","authenticated-orcid":false,"given":"Pablo","family":"Cort\u00e9s","sequence":"additional","affiliation":[{"name":"Escuela T\u00e9cnica Superior de Ingenier\u00eda, Universidad de Sevilla, Camino de los Descubrimientos s\/n, 41092 Sevilla, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for fl exible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"Intern. J. Prod. Econ."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"117460","DOI":"10.1016\/j.eswa.2022.117460","article-title":"An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown","volume":"203","author":"Zhang","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"117182","DOI":"10.1016\/j.eswa.2022.117182","article-title":"A hybrid differential evolution algorithm for flexible job shop scheduling with outsourcing operations and job priority constraints","volume":"201","author":"Li","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_4","first-page":"481","article-title":"Due date optimization in multi-objective scheduling of flexible job shop production","volume":"15","author":"Ojstersek","year":"2020","journal-title":"Adv. Prod. Eng. Manag."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3110","DOI":"10.3934\/mbe.2022144","article-title":"Due-window assignment scheduling with past-sequence-dependent setup times","volume":"19","author":"Liu","year":"2022","journal-title":"Math. Biosci. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"46346","DOI":"10.1109\/ACCESS.2018.2866133","article-title":"Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem Considering Energy Consumption","volume":"6","author":"Jiang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00170-007-0945-8","article-title":"Pareto archive particle swarm optimization for multi- objective fuzzy job shop scheduling problems","volume":"37","author":"Lei","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s00170-011-3244-3","article-title":"A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm","volume":"56","author":"Hu","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.1007\/s00170-012-4482-8","article-title":"Minimizing makespan in a group shop with fuzzy release dates and processing times","volume":"66","author":"Ahmadizar","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10700-015-9225-5","article-title":"Survey on fuzzy shop scheduling","volume":"15","author":"Behnamian","year":"2016","journal-title":"Fuzzy Optim. Decis. Mak."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2075","DOI":"10.3233\/JIFS-16164","article-title":"Stochastic group shop scheduling with fuzzy due dates","volume":"33","author":"Ahmadizar","year":"2017","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_12","unstructured":"Kacem, I., Hammadi, S., and Borne, P. (2002, January 6\u20139). Pareto-optimality Approach Based on Uniform Design and Fuzzy Evolutionary Algorithms for Flexible Job-shop Scheduling Problems (FJSPs). Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s11633-012-0620-x","article-title":"An Efficient Frontier for Sum Deviation JIT Sequencing Problem in Mixed-model Systems via Apportionment","volume":"9","author":"Dhamala","year":"2012","journal-title":"Int. J. Autom. Comput."},{"key":"ref_14","first-page":"219","article-title":"Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems","volume":"32","author":"Cano","year":"2020","journal-title":"J. King Saud Univ.-Eng. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"Bulkan","year":"2015","journal-title":"J. Intell. Manuf."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"100632","DOI":"10.1016\/j.swevo.2019.100632","article-title":"Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm","volume":"53","author":"Soto","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12199","article-title":"A research survey: Review of flexible job shop scheduling techniques","volume":"23","author":"Chaudhry","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_18","first-page":"242","article-title":"Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: A tabu search algorithm","volume":"16","author":"Hajibabaei","year":"2021","journal-title":"Int. J. Manag. Sci. Eng. Manag."},{"key":"ref_19","first-page":"359","article-title":"Multi-objective optimization of production scheduling with evolutionary computation: A review","volume":"11","author":"Ojstersek","year":"2020","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"9270802","DOI":"10.1155\/2018\/9270802","article-title":"Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems","volume":"2018","author":"Amjad","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the Flexible Job-shop Scheduling Problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","article-title":"An effective genetic algorithm for the flexible job-shop scheduling problem","volume":"38","author":"Zhang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"11428","DOI":"10.1016\/j.eswa.2012.04.019","article-title":"A hybrid genetic algorithm for the discrete time-cost trade-off problem","volume":"39","author":"Sonmez","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/0952813X.2013.782347","article-title":"Metaheuristics: Review and application","volume":"25","author":"Gogna","year":"2013","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2828","DOI":"10.1080\/00949655.2017.1344846","article-title":"Multi-objective fuzzy flexible job shop scheduling using memetic algorithm","volume":"87","author":"Wang","year":"2017","journal-title":"J. Stat. Comput. Simul."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"123","DOI":"10.2507\/IJSIMM19-1-CO1","article-title":"A multi-objective flexible job-shop scheduling model based on fuzzy theory and immune genetic algorithm","volume":"19","author":"Shi","year":"2020","journal-title":"Int. J. Simul. Model."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ifacol.2015.06.184","article-title":"Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints","volume":"48","author":"Zhang","year":"2015","journal-title":"IFAC-PapersOnLine"},{"key":"ref_28","first-page":"887","article-title":"Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete multi objective invasive weed optimization and fuzzy dominance approach","volume":"10","author":"Jafarzadeh","year":"2017","journal-title":"J. Ind. Eng. Manag."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","article-title":"Hybrid Particle Swarm Optimization Combined With Genetic Operators for Flexible Job-Shop Scheduling Under Uncertain Processing Time for Semiconductor Manufacturing","volume":"31","author":"Jamrus","year":"2018","journal-title":"IEEE Trans. Semicond. Manuf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"10016","DOI":"10.1016\/j.eswa.2012.01.211","article-title":"Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm","volume":"39","author":"Chen","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","article-title":"An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem","volume":"29","author":"Nouiri","year":"2018","journal-title":"J. Intell. Manuf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"116785","DOI":"10.1016\/j.eswa.2022.116785","article-title":"Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds","volume":"197","author":"Wei","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-319-41009-8_6","article-title":"Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry","volume":"9713","author":"Ortiz","year":"2016","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","article-title":"Evaluation of mathematical models for flexible job-shop scheduling problems","volume":"37","author":"Demir","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1504\/IJCAT.2013.054360","article-title":"An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem","volume":"47","author":"Wang","year":"2013","journal-title":"Int. J. Comput. Appl. Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-030-20485-3_24","article-title":"Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses","volume":"Volume 353","author":"Abramowicz","year":"2019","journal-title":"Lecture Notes in Business Information Processing"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Cano, J.A., Cort\u00e9s, P., Mu\u00f1uzuri, J., and Correa-Espinal, A. (2022). Solving the picker routing problem in multi-block high-level storage systems using metaheuristics. Flex. Serv. Manuf. J.","DOI":"10.1007\/s10696-022-09445-y"},{"key":"ref_38","unstructured":"Coello, C.A. (2022). Introducci\u00f3n a la Computaci\u00f3n Evolutiva (Notas de Curso), CINVESTAV-IPN. Available online: https:\/\/delta.cs.cinvestav.mx\/~ccoello\/compevol\/apuntes.pdf."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.procs.2012.09.041","article-title":"Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems","volume":"12","author":"Teekeng","year":"2012","journal-title":"Procedia Comput. Sci."},{"key":"ref_40","unstructured":"Ruiz, S. (2015). Metodolog\u00eda multiobjetivo basada en un comportamiento evolutivo para programar sistemas de producci\u00f3n flexible job shop. Aplicaciones en la Industria Metalmec\u00e1nica, Universidad Nacional de Colombia."},{"key":"ref_41","first-page":"89","article-title":"Tardiness minimization for the flexible flowshop with setup using constructive heuristics and a genetic algorithm","volume":"20","author":"Salazar","year":"2012","journal-title":"Ingeniare"},{"key":"ref_42","unstructured":"Gonz\u00e1lez, \u00c1. (2013). Dise\u00f1o de una metodolog\u00eda de programaci\u00f3n de producci\u00f3n para la reducci\u00f3n de costos en un flow shop h\u00edbrido flexible mediante el uso de algoritmos gen\u00e9ticos. Aplicaci\u00f3n a la Industria Textil, Universidad Nacional de Colombia."},{"key":"ref_43","first-page":"155","article-title":"Operation scheduling with setup times by local optimization algorithms","volume":"9","author":"Companys","year":"2005","journal-title":"Universidad, Cienc. y Tecnol."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by taboo search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","article-title":"Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic","volume":"60","author":"Kacem","year":"2002","journal-title":"Math. Comput. Simul."},{"key":"ref_46","unstructured":"Barnes, J.W., and Chambers, J.B. (1996). Flexible job shop scheduling by tabu search. Graduate Program in Operations and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09, The University of Texas at Austin."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"OR Spectr."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/334\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:34:50Z","timestamp":1760142890000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,20]]},"references-count":47,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["a15100334"],"URL":"https:\/\/doi.org\/10.3390\/a15100334","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,20]]}}}