Show simple item record

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

dc.contributor.authorCampo E.A
dc.contributor.authorCano J.A
dc.contributor.authorGómez-Montoya R
dc.contributor.authorRodríguez-Velásquez E
dc.contributor.authorCortés P.
dc.date.accessioned2023-10-24T19:25:08Z
dc.date.available2023-10-24T19:25:08Z
dc.date.created2022
dc.identifier.issn19994893
dc.identifier.urihttp://hdl.handle.net/11407/8040
dc.description.abstractThe 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. © 2022 by the authors.eng
dc.language.isoeng
dc.publisherMDPI
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85140374105&doi=10.3390%2fa15100334&partnerID=40&md5=eeafe5d069b4a90edbed6dccaae2804e
dc.sourceAlgorithms
dc.sourceAlgorithmseng
dc.subjectEarliness/tardinesseng
dc.subjectFlexible job shopeng
dc.subjectFuzzy logiceng
dc.subjectGenetic algorithmeng
dc.subjectProduction schedulingeng
dc.subjectSequence-dependent setup timeseng
dc.subjectTime windowseng
dc.subjectUncertaintyeng
dc.titleFlexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithmseng
dc.typeArticle
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.publisher.programAdministración de Empresasspa
dc.type.spaArtículo
dc.identifier.doi10.3390/a15100334
dc.relation.citationvolume15
dc.relation.citationissue10
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativasspa
dc.affiliationCampo, E.A., Faculty of Economic and Administrative Sciences, Universidad de Medellin, Medellin, 050026, Colombia
dc.affiliationCano, J.A., Faculty of Economic and Administrative Sciences, Universidad de Medellin, Medellin, 050026, Colombia
dc.affiliationGómez-Montoya, R., Faculty of Administration, Politécnico Colombiano Jaime Isaza Cadavid, Medellin, 050022, Colombia
dc.affiliationRodríguez-Velásquez, E., Facultad de Minas, Universidad Nacional de Colombia, Medellin, 050034, Colombia
dc.affiliationCortés, P., Escuela Técnica Superior de Ingeniería, Universidad de Sevilla, Camino de los Descubrimientos s/n, Sevilla, 41092, Spain
dc.relation.referencesLi, X., Gao, L., An effective hybrid genetic algorithm and tabu search for fl exible job shop scheduling problem (2016) Intern. J. Prod. Econ, 174, pp. 93-110
dc.relation.referencesZhang, G., Lu, X., Liu, X., Zhang, L., Wei, S., Zhang, W., An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown (2022) Expert Syst. Appl, 203, p. 117460
dc.relation.referencesLi, H., Wang, X., Peng, J., A hybrid differential evolution algorithm for flexible job shop scheduling with outsourcing operations and job priority constraints (2022) Expert Syst. Appl, 201, p. 117182
dc.relation.referencesOjstersek, R., Tang, M., Buchmeister, B., Due date optimization in multi-objective scheduling of flexible job shop production (2020) Adv. Prod. Eng. Manag, 15, pp. 481-492
dc.relation.referencesLiu, W., Wang, X., Wang, X., Zhao, P., Due-window assignment scheduling with past-sequence-dependent setup times (2022) Math. Biosci. Eng, 19, pp. 3110-3126. , 35240823
dc.relation.referencesJiang, T., Deng, G., Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem Considering Energy Consumption (2018) IEEE Access, 6, pp. 46346-46355
dc.relation.referencesLei, D., Pareto archive particle swarm optimization for multi- objective fuzzy job shop scheduling problems (2008) Int. J. Adv. Manuf. Technol, 37, pp. 157-165
dc.relation.referencesHu, Y., Yin, M., Li, X., A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm (2011) Int. J. Adv. Manuf. Technol, 56, pp. 1125-1138
dc.relation.referencesAhmadizar, F., Zarei, A., Minimizing makespan in a group shop with fuzzy release dates and processing times (2013) Int. J. Adv. Manuf. Technol, 66, pp. 2063-2074
dc.relation.referencesBehnamian, J., Survey on fuzzy shop scheduling (2016) Fuzzy Optim. Decis. Mak, 15, pp. 331-366
dc.relation.referencesAhmadizar, F., Rabanimotlagh, A., Arkat, J., Stochastic group shop scheduling with fuzzy due dates (2017) J. Intell. Fuzzy Syst, 33, pp. 2075-2084
dc.relation.referencesKacem, I., Hammadi, S., Borne, P., 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, pp. 304-310. , Yasmine Hammamet, Tunisia, 6–9 October 2002
dc.relation.referencesDhamala, T.N., Thapa, G.B., Yu, H.-N., An Efficient Frontier for Sum Deviation JIT Sequencing Problem in Mixed-model Systems via Apportionment (2012) Int. J. Autom. Comput, 9, pp. 87-97
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems (2020) J. King Saud Univ.-Eng. Sci, 32, pp. 219-228
dc.relation.referencesÇaliş, B., Bulkan, S., A research survey: Review of AI solution strategies of job shop scheduling problem (2015) J. Intell. Manuf, 26, pp. 961-973
dc.relation.referencesSoto, C., Dorronsoro, B., Fraire, H., Cruz-Reyes, L., Gomez-Santillan, C., Rangel, N., Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm (2020) Swarm Evol. Comput, 53, p. 100632
dc.relation.referencesChaudhry, I.A., Khan, A.A., A research survey: Review of flexible job shop scheduling techniques (2016) Int. Trans. Oper. Res, 23, pp. 551-591
dc.relation.referencesHajibabaei, M., Behnamian, J., Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: A tabu search algorithm (2021) Int. J. Manag. Sci. Eng. Manag, 16, pp. 242-253
dc.relation.referencesOjstersek, R., Brezocnik, M., Buchmeister, B., Multi-objective optimization of production scheduling with evolutionary computation: A review (2020) Int. J. Ind. Eng. Comput, 11, pp. 359-376
dc.relation.referencesAmjad, M.K., Butt, S.I., Kousar, R., Ahmad, R., Agha, M.H., Faping, Z., Anjum, N., Asgher, U., Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems (2018) Math. Probl. Eng, 2018, p. 9270802
dc.relation.referencesPezzella, F., Morganti, G., Ciaschetti, G., A genetic algorithm for the Flexible Job-shop Scheduling Problem (2008) Comput. Oper. Res, 35, pp. 3202-3212
dc.relation.referencesZhang, G., Gao, L., Shi, Y., An effective genetic algorithm for the flexible job-shop scheduling problem (2011) Expert Syst. Appl, 38, pp. 3563-3573
dc.relation.referencesSonmez, R., Bettemir, Ö.H., A hybrid genetic algorithm for the discrete time-cost trade-off problem (2012) Expert Syst. Appl, 39, pp. 11428-11434
dc.relation.referencesGogna, A., Tayal, A., Metaheuristics: Review and application (2013) J. Exp. Theor. Artif. Intell, 25, pp. 503-526
dc.relation.referencesWang, C., Tian, N., Ji, Z., Wang, Y., Multi-objective fuzzy flexible job shop scheduling using memetic algorithm (2017) J. Stat. Comput. Simul, 87, pp. 2828-2846
dc.relation.referencesShi, D.L., Zhang, B.B., Li, Y., A multi-objective flexible job-shop scheduling model based on fuzzy theory and immune genetic algorithm (2020) Int. J. Simul. Model, 19, pp. 123-133
dc.relation.referencesZhang, H., Collart-Dutilleul, S., Mesghouni, K., Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints (2015) IFAC-PapersOnLine, 48, pp. 816-821
dc.relation.referencesJafarzadeh, H., Moradinasab, N., Gerami, A., 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 (2017) J. Ind. Eng. Manag, 10, pp. 887-918
dc.relation.referencesJamrus, T., Chien, C.F., Gen, M., Sethanan, K., Hybrid Particle Swarm Optimization Combined With Genetic Operators for Flexible Job-Shop Scheduling Under Uncertain Processing Time for Semiconductor Manufacturing (2018) IEEE Trans. Semicond. Manuf, 31, pp. 32-41
dc.relation.referencesChen, J.C., Wu, C.C., Chen, C.W., Chen, K.H., Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm (2012) Expert Syst. Appl, 39, pp. 10016-10021
dc.relation.referencesNouiri, M., Bekrar, A., Jemai, A., Niar, S., An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem (2018) J. Intell. Manuf, 29, pp. 603-615
dc.relation.referencesWei, Z., Liao, W., Zhang, L., Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds (2022) Expert Syst. Appl, 197, p. 116785
dc.relation.referencesOrtiz, M., Neira, D., Jiménez, G., Hernández, H., Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry (2016) Lect. Notes Comput. Sci, 9713, pp. 47-58
dc.relation.referencesDemir, Y., Işleyen, S.K., Evaluation of mathematical models for flexible job-shop scheduling problems (2013) Appl. Math. Model, 37, pp. 977-988
dc.relation.referencesWang, W., Li, X., Zhang, Y., An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem (2013) Int. J. Comput. Appl. Technol, 47, pp. 280-288
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., Cortés, P., Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses (2019) Lecture Notes in Business Information Processing, 353, pp. 313-322. , Abramowicz W., Corchuelo R., (eds), Springer, Cham, Switzerland
dc.relation.referencesCano, J.A., Cortés, P., Muñuzuri, J., Correa-Espinal, A., Solving the picker routing problem in multi-block high-level storage systems using metaheuristics (2022) Flex. Serv. Manuf. J
dc.relation.referencesCoello, C.A., (2022) Introducción a la Computación Evolutiva (Notas de Curso), pp. 1-296. , https://delta.cs.cinvestav.mx/~ccoello/compevol/apuntes.pdf, CINVESTAV-IPN, Mexico City, Mexico, Available online
dc.relation.referencesTeekeng, W., Thammano, A., Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems (2012) Procedia Comput. Sci, 12, pp. 122-128
dc.relation.referencesRuiz, S., Metodología multiobjetivo basada en un comportamiento evolutivo para programar sistemas de producción flexible job shop (2015) Aplicaciones en la Industria Metalmecánica, , Universidad Nacional de Colombia, Bogotá, Colombia
dc.relation.referencesSalazar, E., Figueroa, B., Tardiness minimization for the flexible flowshop with setup using constructive heuristics and a genetic algorithm (2012) Ingeniare, 20, pp. 89-98
dc.relation.referencesGonzález, Á., Diseño de una metodología de programación de producción para la reducción de costos en un flow shop híbrido flexible mediante el uso de algoritmos genéticos (2013) Aplicación a la Industria Textil, , Universidad Nacional de Colombia, Bogotá, Colombia
dc.relation.referencesCompanys, R., D’Armas, M., Operation scheduling with setup times by local optimization algorithms (2005) Universidad, Cienc. y Tecnol, 9, pp. 155-162
dc.relation.referencesBrandimarte, P., Routing and scheduling in a flexible job shop by taboo search (1993) Ann. Oper. Res, 41, pp. 157-183
dc.relation.referencesKacem, I., Hammadi, S., Borne, P., Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic (2002) Math. Comput. Simul, 60, pp. 245-276
dc.relation.referencesBarnes, J.W., Chambers, J.B., Flexible job shop scheduling by tabu search (1996) Graduate Program in Operations and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09, , The University of Texas at Austin, Austin, TX, USA
dc.relation.referencesHurink, J., Jurisch, B., Thole, M., Tabu search for the job-shop scheduling problem with multi-purpose machines (1994) OR Spectr, 15, pp. 205-215
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.identifier.reponamereponame:Repositorio Institucional Universidad de Medellín
dc.identifier.repourlrepourl:https://repository.udem.edu.co/
dc.identifier.instnameinstname:Universidad de Medellín


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record