{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:44Z","timestamp":1775068904683,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"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>We address a scheduling problem in an actual environment of the tortilla industry. Since the problem is NP hard, we focus on suboptimal scheduling solutions. We concentrate on a complex multistage, multiproduct, multimachine, and batch production environment considering completion time and energy consumption optimization criteria. The production of wheat-based and corn-based tortillas of different styles is considered. The proposed bi-objective algorithm is based on the known Nondominated Sorting Genetic Algorithm II (NSGA-II). To tune it up, we apply statistical analysis of multifactorial variance. A branch and bound algorithm is used to assert obtained performance. We show that the proposed algorithms can be efficiently used in a real production environment. The mono-objective and bi-objective analyses provide a good compromise between saving energy and efficiency. To demonstrate the practical relevance of the results, we examine our solution on real data. We find that it can save 48% of production time and 47% of electricity consumption over the actual production.<\/jats:p>","DOI":"10.3390\/a11050068","type":"journal-article","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T03:48:27Z","timestamp":1525924107000},"page":"68","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing"],"prefix":"10.3390","volume":"11","author":[{"given":"Victor","family":"Yaurima-Basaldua","sequence":"first","affiliation":[{"name":"Software Engineering, Sonora State University, San Luis Rio Colorado, Sonora 83455, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5029-5212","authenticated-orcid":false,"given":"Andrei","family":"Tchernykh","sequence":"additional","affiliation":[{"name":"Computer Science Department, CICESE Research Center, Ensenada 22860, Mexico"},{"name":"School of Electrical Engineering and Computer Science, South Ural State University, Chelyabinsk 454080, Russia"}]},{"given":"Francisco","family":"Villalobos-Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Software Engineering, Sonora State University, San Luis Rio Colorado, Sonora 83455, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6486-2131","authenticated-orcid":false,"given":"Ricardo","family":"Salomon-Torres","sequence":"additional","affiliation":[{"name":"Software Engineering, Sonora State University, San Luis Rio Colorado, Sonora 83455, Mexico"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","article-title":"Hybrid flow shop scheduling: A survey","volume":"37","author":"Linn","year":"1999","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1016\/j.ejor.2006.01.042","article-title":"A taxonomy of flexible flow line scheduling procedures","volume":"178","author":"Quadt","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1016\/j.cie.2008.09.004","article-title":"Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers","volume":"56","author":"Yaurima","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6309","DOI":"10.1016\/j.eswa.2011.11.117","article-title":"Enhanced parallel cat swarm optimization based on the Taguchi method","volume":"39","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_6","first-page":"43","article-title":"Hybrid Job Scheduling Algorithm for Cloud Computing Environment","volume":"Volume 303","author":"Komer","year":"2014","journal-title":"Proceedings of the Fifth International Conference on Innovations in Bio-Inspired Computing and Applications IBICA 2014"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","article-title":"Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective","volume":"37","author":"Ribas","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ijpe.2013.01.028","article-title":"Hybrid flow shop scheduling considering machine electricity consumption cost","volume":"146","author":"Luo","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.cirp.2011.03.099","article-title":"A study on energy efficiency improvement for machine tools","volume":"60","author":"Mori","year":"2011","journal-title":"CIRP Ann. Manuf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chiong, R., Weise, T., and Michalewicz, Z. (2012). Evolutionary optimization. Variants of Evolutionary Algorithms for Real-World Applications, Springer.","DOI":"10.1007\/978-3-642-23424-8"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.jclepro.2015.04.038","article-title":"Reducing environmental impact of production during a rolling blackout policy\u2014A multi-objective schedule optimisation approach","volume":"102","author":"Liu","year":"2015","journal-title":"J. Clean. Prod."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.jclepro.2014.11.041","article-title":"An investigation on minimizing cycle time and total energy consumption in robotic assembly line systems","volume":"90","author":"Nilakantan","year":"2015","journal-title":"J. Clean. Prod."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.jclepro.2014.10.008","article-title":"A systematic approach of process planning and scheduling optimization for sustainable machining","volume":"87","author":"Wang","year":"2015","journal-title":"J. Clean. Prod."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/00207543.2013.825740","article-title":"Reduction of power consumption and carbon footprints by applying multi-objective optimisation via genetic algorithms","volume":"52","author":"Liu","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"7071","DOI":"10.1080\/00207543.2015.1005248","article-title":"Multi-objective genetic algorithm for energy-efficient job shop scheduling","volume":"53","author":"May","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","article-title":"Solving the energy-efficient job shop scheduling problem: A multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption","volume":"112","author":"Zhang","year":"2016","journal-title":"J. Clean. Prod."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1080\/00207540701450013","article-title":"Operational methods for minimization of energy consumption of manufacturing equipment","volume":"45","author":"Mouzon","year":"2007","journal-title":"Int. J. Prod. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.rcim.2013.04.001","article-title":"Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm","volume":"29","author":"Dai","year":"2013","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.ejor.2015.08.064","article-title":"Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption","volume":"248","author":"Mansouri","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"6837","DOI":"10.1016\/j.eswa.2013.06.038","article-title":"A case study on using evolutionary algorithms to optimize bakery production planning","volume":"40","author":"Hecker","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"5882","DOI":"10.1016\/j.eswa.2014.03.047","article-title":"Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery","volume":"41","author":"Hecker","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1995.3.1.1","article-title":"An overview of evolutionary algorithms in multiobjective optimization","volume":"3","author":"Fonseca","year":"1995","journal-title":"Evol. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","article-title":"Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises","volume":"229","author":"Hosseinabadi","year":"2015","journal-title":"Ann. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Doumpos, M., and Grigoroudis, E. (2013). Interactive Approaches Applied to Multiobjective Evolutionary Algorithms. Multicriteria Decision Aid and Artificial Intelligence, John Wiley & Sons, Ltd.","DOI":"10.1002\/9781118522516"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1016\/j.csda.2013.04.008","article-title":"Optimal designed experiments using a pareto front search for focused preference of multiple objectives","volume":"71","author":"Lu","year":"2014","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1109\/TEVC.2010.2058119","article-title":"Integration of preferences in hypervolume-based multiobjective evolutionary algorithms by means of desirability functions","volume":"14","author":"Wagner","year":"2010","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_28","unstructured":"Baker, K.R. (1974). Introduction to Sequencing and Scheduling, John Wiley & Sons, Ltd."},{"key":"ref_29","unstructured":"Pinedo, M. (2002). Scheduling: Theory, Algorithms, and Systems, Prentice Hall."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00170-011-3368-5","article-title":"Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers","volume":"58","author":"Abyaneh","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Math."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: A review of representations and operators","volume":"13","author":"Kuijpers","year":"1999","journal-title":"Artif. Intell. Rev."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","article-title":"Heuristic methods for vehicle routing problem with time windows","volume":"15","author":"Tan","year":"2001","journal-title":"Artif. Intell. Eng."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Gog, A., and Chira, C. (2011). Comparative Analysis of Recombination Operators in Genetic Algorithms for the Travelling Salesman Problem, Springer.","DOI":"10.1007\/978-3-642-21222-2_2"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0360-8352(02)00033-5","article-title":"An improved model for vehicle routing problem with time constraint based on genetic algorithm","volume":"42","author":"Hwang","year":"2002","journal-title":"Comput. Ind. Eng."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_37","unstructured":"Belew, R.K., and Booker, L.B. A comparison of genetic sequencing operators. Proceedings of the 4th International Conference on Genetic Algorithms."},{"key":"ref_38","unstructured":"(2017, March 04). The R Project for Statistical Computing. Available online: https:\/\/www.r-project.org\/."},{"key":"ref_39","unstructured":"Montgomery, D.C., and Runger, G.C. (1994). Applied Statistics and Probability for Engineers, John Wiley & Sons, Inc."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1007\/s00170-008-1558-6","article-title":"A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem","volume":"41","author":"Dangchi","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/68\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:03:54Z","timestamp":1760195034000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":40,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["a11050068"],"URL":"https:\/\/doi.org\/10.3390\/a11050068","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]}}}