{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T13:14:13Z","timestamp":1771334053909,"version":"3.50.1"},"reference-count":81,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T00:00:00Z","timestamp":1626220800000},"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>This paper proposes a hybridized simheuristic approach that couples a greedy randomized adaptive search procedure (GRASP), a Monte Carlo simulation, a Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve a multicriteria stochastic permutation flow shop problem with stochastic processing times and stochastic sequence-dependent setup times. For the decisional criteria, the proposed approach considers four objective functions, including two quantitative and two qualitative criteria. While the expected value and the standard deviation of the earliness\/tardiness of jobs are included in the quantitative criteria to address a robust solution in a just-in-time environment, this approach also includes a qualitative assessment of the product and customer importance in order to appraise a weighted priority for each job. An experimental design was carried out in several study instances of the flow shop problem to test the effects of the processing times and sequence-dependent setup times, obtained through lognormal and uniform probability distributions with three levels of coefficients of variation, settled as 0.3, 0.4, and 0.5. The results show that both probability distributions and coefficients of variation have a significant effect on the four decision criteria selected. In addition, the analytical hierarchical process makes it possible to choose the best sequence exhibited by the Pareto frontier that adjusts more adequately to the decision-makers\u2019 objectives.<\/jats:p>","DOI":"10.3390\/a14070210","type":"journal-article","created":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T02:28:01Z","timestamp":1626229681000},"page":"210","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Multicriteria Simheuristic Approach for Solving a Stochastic Permutation Flow Shop Scheduling Problem"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-3401","authenticated-orcid":false,"given":"Eliana Maria","family":"Gonzalez-Neira","sequence":"first","affiliation":[{"name":"Departamento de Ingenier\u00eda Industrial, Facultad de Ingenier\u00eda, Pontificia Universidad Javeriana, Bogot\u00e1 110231, Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6251-3667","authenticated-orcid":false,"given":"Jairo R.","family":"Montoya-Torres","sequence":"additional","affiliation":[{"name":"Facultad de Ingenier\u00eda, Universidad de La Sabana, Ch\u00eda 140013, Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8336-6240","authenticated-orcid":false,"given":"Jose-Fernando","family":"Jimenez","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda Industrial, Facultad de Ingenier\u00eda, Pontificia Universidad Javeriana, Bogot\u00e1 110231, Colombia"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L. (2016). Scheduling, Springer International Publishing. [5th ed.].","DOI":"10.1007\/978-3-319-26580-3"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","article-title":"A comprehensive review and evaluation of permutation flowshop heuristics","volume":"165","author":"Ruiz","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing Total Tardiness on One Machine Is NP-Hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.compchemeng.2007.03.001","article-title":"Process scheduling under uncertainty: Review and challenges","volume":"32","author":"Li","year":"2008","journal-title":"Comput. Chem. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/12460125.2000.9736710","article-title":"A review of the static stochastic flow-shop scheduling problem","volume":"9","author":"Gourgand","year":"2000","journal-title":"J. Decis. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","article-title":"New hard benchmark for flowshop scheduling problems minimising makespan","volume":"240","author":"Vallada","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","article-title":"Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends","volume":"45","author":"Yenisey","year":"2014","journal-title":"Omega"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1080\/0951120010020749","article-title":"Modelling of job-shop scheduling with multiple quantitative and qualitative objectives and a GA\/TS mixture approach","volume":"14","author":"Chang","year":"2001","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5719","DOI":"10.1080\/00207540600693523","article-title":"Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem","volume":"46","author":"Chang","year":"2008","journal-title":"Int. J. Prod. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.cie.2016.08.026","article-title":"Stochastic flexible flow shop scheduling problem under quantitative and qualitative decision criteria","volume":"101","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1057\/jos.2016.11","article-title":"A simheuristic algorithm for solving the arc routing problem with stochastic demands","volume":"12","author":"Juan","year":"2018","journal-title":"J. Simul."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"114240","DOI":"10.1016\/j.eswa.2020.114240","article-title":"Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands","volume":"168","author":"Ferone","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Quintero-Araujo, C.L., Guimarans, D., and Juan, A.A. (2019). A simheuristic algorithm for the capacitated location routing problem with stochastic demands. J. Simul., 1\u201318.","DOI":"10.1080\/17477778.2019.1680262"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.simpat.2013.11.008","article-title":"A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs","volume":"46","author":"Juan","year":"2014","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1057\/s41274-016-0155-6","article-title":"Solving the deterministic and stochastic uncapacitated facility location problem: From a heuristic to a simheuristic","volume":"68","author":"Juan","year":"2017","journal-title":"J. Oper. Res. Soc."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"106026","DOI":"10.1016\/j.cie.2019.106026","article-title":"Robust solutions in multi-objective stochastic permutation flow shop problem","volume":"137","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.simpat.2018.04.005","article-title":"A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem","volume":"86","author":"Hatami","year":"2018","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.simpat.2014.02.005","article-title":"A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times","volume":"46","author":"Juan","year":"2014","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"7132","DOI":"10.1016\/j.eswa.2015.05.015","article-title":"A Monte Carlo simulation based chaotic differential evolution algorithm for scheduling a stochastic parallel processor system","volume":"42","author":"Mokhtari","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_20","unstructured":"Caramia, M., Bianco, L., and Giordani, S. (2018). A simheuristic for stochastic permutation flow shop problem considering quantitative and qualitative decision criteria. Proceedings of the 16th International Conference on Project Management and Scheduling, TexMat."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","article-title":"Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study","volume":"227","author":"Ciavotta","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","article-title":"A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime","volume":"40","author":"Pan","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_23","first-page":"1","article-title":"Meta-heuristic approaches for flowshop scheduling problems: A review","volume":"8","author":"Arora","year":"2016","journal-title":"Int. J. Adv. Oper. Manag."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1007\/s00170-015-8209-5","article-title":"Review and classification of constructive heuristics mechanisms for no-wait flow shop problem","volume":"86","author":"Nagano","year":"2016","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","article-title":"The Non-Permutation Flow-Shop scheduling problem: A literature review","volume":"77","author":"Rossit","year":"2018","journal-title":"Omega"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","article-title":"A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation","volume":"257","author":"Ruiz","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","first-page":"399","article-title":"Flow-shop scheduling problem under uncertainties: Review and trends","volume":"8","author":"Barrera","year":"2017","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.ejor.2015.05.006","article-title":"On heuristic solutions for the stochastic flowshop scheduling problem","volume":"246","author":"Framinan","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.simpat.2014.10.008","article-title":"Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing","volume":"51","author":"Lin","year":"2015","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10845-015-1144-3","article-title":"An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time","volume":"29","author":"Qin","year":"2018","journal-title":"J. Intell. Manuf."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1080\/0951192X.2015.1067907","article-title":"A hybrid meta-heuristic algorithm for flowshop robust scheduling under machine breakdown uncertainty","volume":"29","author":"Fazayeli","year":"2016","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1057\/jors.2014.100","article-title":"Scheduling the two-machine flowshop to hedge against processing time uncertainty","volume":"66","author":"Ying","year":"2015","journal-title":"J. Oper. Res. Soc."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10845-014-0890-y","article-title":"A survey of multi-factory scheduling","volume":"27","author":"Behnamian","year":"2016","journal-title":"J. Intell. Manuf."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"4999","DOI":"10.1016\/j.eswa.2011.10.013","article-title":"Modified genetic algorithms for solving fuzzy flow shop scheduling problems and their implementation with CUDA","volume":"39","author":"Huang","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_35","first-page":"32","article-title":"On a scheduling problem","volume":"8","author":"Makino","year":"1965","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"ref_36","first-page":"93","article-title":"A Note on Sequencing Problem with Uncertain Job Time","volume":"9","author":"Talwar","year":"1967","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800200107","article-title":"Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop","volume":"20","author":"Cunningham","year":"1973","journal-title":"Nav. Res. Logist. Q."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0377-2217(02)00077-2","article-title":"An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns","volume":"140","author":"Alcaide","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0377-2217(02)00835-4","article-title":"A contribution to the stochastic flow shop scheduling problem","volume":"151","author":"Gourgand","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1414","DOI":"10.1007\/s00170-004-2097-4","article-title":"Ordinal optimisation of genetic control parameters for flow shop scheduling","volume":"26","author":"Wang","year":"2005","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.ejor.2004.08.045","article-title":"A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation","volume":"169","author":"Kalczynski","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.ejor.2004.09.056","article-title":"Johnson\u2019s problem with stochastic processing times and optimal service level","volume":"169","author":"Portougal","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10951-010-0219-4","article-title":"Three heuristic procedures for the stochastic, two-machine flow shop problem","volume":"14","author":"Baker","year":"2011","journal-title":"J. Sched."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.ejor.2011.07.021","article-title":"Heuristic solution methods for the stochastic flow shop problem","volume":"216","author":"Baker","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1016\/j.mcm.2012.10.017","article-title":"Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming","volume":"57","author":"Elyasi","year":"2013","journal-title":"Math. Comput. Model."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00170-012-4328-4","article-title":"Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs","volume":"66","author":"Elyasi","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.simpat.2017.09.001","article-title":"A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times","volume":"79","author":"Ferone","year":"2017","journal-title":"Simul. Model. Pract. Theory"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1080\/17477778.2018.1473908","article-title":"A comparison of dispatching rules hybridised with Monte Carlo Simulation in stochastic permutation flow shop problem","volume":"13","year":"2019","journal-title":"J. Simul."},{"key":"ref_49","first-page":"162","article-title":"A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down","volume":"10","author":"Marichelvam","year":"2019","journal-title":"Int. J. Enterp. Netw. Manag."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1111\/itor.12862","article-title":"A simheuristic algorithm for the stochastic permutation flow-shop problem with delivery dates and cumulative payoffs","volume":"28","author":"Villarinho","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TEM.2017.2712611","article-title":"On the Robust and Stable Flowshop Scheduling Under Stochastic and Dynamic Disruptions","volume":"64","author":"Liu","year":"2017","journal-title":"IEEE Trans. Eng. Manag."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1080\/0305215X.2019.1607848","article-title":"Min\u2013max regret criterion-based robust model for the permutation flow-shop scheduling problem","volume":"52","author":"Liao","year":"2020","journal-title":"Eng. Optim."},{"key":"ref_53","first-page":"294","article-title":"A robust just-in-time flow shop scheduling problem with outsourcing option on subcontractors","volume":"7","author":"Goli","year":"2019","journal-title":"Prod. Manuf. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-010-2533-6","article-title":"A flexible artificial neural network\u2013fuzzy simulation algorithm for scheduling a flow shop with multiple processors","volume":"50","author":"Azadeh","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00170-010-3149-6","article-title":"An improved genetic algorithm for robust permutation flowshop scheduling","volume":"56","author":"Liu","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","article-title":"Approximating a two-machine flow shop scheduling under discrete scenario uncertainty","volume":"217","author":"Kasperski","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1016\/j.cor.2013.02.016","article-title":"Taking advantage of a diverse set of efficient production schedules: A two-step approach for scheduling with side concerns","volume":"40","author":"Pierreval","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.jmsy.2013.03.004","article-title":"Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times","volume":"33","author":"Rahmani","year":"2014","journal-title":"J. Manuf. Syst."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/0951192X.2014.1002814","article-title":"A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties","volume":"29","author":"Shahnaghi","year":"2015","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1080\/0951192X.2016.1187293","article-title":"Robust and Fuzzy Optimisation Models for a Flow shop Scheduling Problem with Sequence Dependent Setup Times: A real case study on a PCB assembly company","volume":"30","author":"Hakimifar","year":"2017","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10100-017-0485-8","article-title":"Heuristic algorithms for the minmax regret flow-shop problem with interval processing times","volume":"26","year":"2018","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(93)E0284-5","article-title":"Bicriterion stochastic scheduling on one or more machines","volume":"80","author":"Forst","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1142\/S0218488503002466","article-title":"An Evolutionary Algorithm for Pure Fuzzy Flowshop Scheduling Problems","volume":"11","author":"Celano","year":"2003","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_64","first-page":"855","article-title":"Multiobjective genetic algorithm for fuzzy flowshop scheduling problem","volume":"22","author":"Temiz","year":"2007","journal-title":"J. Fac. Eng. Archit. Gazi Univ."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/SOLI.2008.4682806","article-title":"Research on multiobjective flow shop scheduling with stochastic processing times and machine breakdowns","volume":"Volume 22","author":"Zhou","year":"2008","journal-title":"Proceedings of the 2008 IEEE International Conference on Service Operations and Logistics, and Informatics"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"7271","DOI":"10.1080\/00207543.2011.645511","article-title":"An integrated neural network\u2013simulation algorithm for performance optimisation of the bi-criteria two-stage assembly flow-shop scheduling problem with stochastic activities","volume":"50","author":"Azadeh","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"3747","DOI":"10.1016\/j.camwa.2012.02.051","article-title":"On optimizing a bi-objective flowshop scheduling problem in an uncertain environment","volume":"64","author":"Liefooghe","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1504\/IJOR.2014.065411","article-title":"Multi-objective flow shop scheduling problem with stochastic parameters: Fuzzy goal programming approach","volume":"21","author":"Rahmani","year":"2014","journal-title":"Int. J. Oper. Res."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1007\/s10845-015-1129-2","article-title":"An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems","volume":"29","author":"Mou","year":"2018","journal-title":"J. Intell. Manuf."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1007\/s10845-017-1385-4","article-title":"Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm","volume":"30","author":"Fu","year":"2019","journal-title":"J. Intell. Manuf."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"119734","DOI":"10.1016\/j.jclepro.2019.119734","article-title":"Multi-objective green flowshop scheduling problem under uncertainty: Estimation of distribution algorithm","volume":"251","author":"Behnamian","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_72","first-page":"34","article-title":"VEPCE: Decision-making model for vendor evaluation with respect to product prioritisation and customer expectation","volume":"3","author":"Rajan","year":"2007","journal-title":"Int. J. Logist. Syst. Manag."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1080\/095372897234650","article-title":"Priority class scheduling: Production scheduling for multi-objective environments","volume":"8","author":"Brown","year":"1997","journal-title":"Prod. Plan. Control"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0969-6989(02)00061-9","article-title":"Distribution network design: An integer programming approach","volume":"11","author":"Georgakopoulos","year":"2004","journal-title":"J. Retail. Consum. Serv."},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.ejor.2007.10.001","article-title":"Integral analysis method\u2014IAM","volume":"192","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0377-2217(02)00267-9","article-title":"Ordinal criteria in stochastic multicriteria acceptability analysis (SMAA)","volume":"147","author":"Lahdelma","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4419-1665-5_10","article-title":"Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications","volume":"Volume 146","author":"Gendreau","year":"2010","journal-title":"Handbook of Metaheuristics SE-10"},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","article-title":"Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy","volume":"8","author":"Knowles","year":"2000","journal-title":"Evol. Comput."},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2014.06.042","article-title":"Multiobjective GRASP with Path Relinking","volume":"240","author":"Campos","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1016\/j.apm.2013.10.061","article-title":"Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates","volume":"38","author":"Ebrahimi","year":"2014","journal-title":"Appl. Math. Model."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"4024","DOI":"10.1016\/j.eswa.2009.09.005","article-title":"Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach","volume":"37","author":"Karimi","year":"2010","journal-title":"Expert Syst. Appl."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/7\/210\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:30:10Z","timestamp":1760164210000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/7\/210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,14]]},"references-count":81,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["a14070210"],"URL":"https:\/\/doi.org\/10.3390\/a14070210","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,14]]}}}