{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:43:01Z","timestamp":1747190581760,"version":"3.40.5"},"reference-count":67,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2021,7,6]]},"abstract":"<jats:p>Although the Multihoist Scheduling Problem (MHSP) can be detailed as a job-shop configuration, the MHSP has additional constraints. Such constraints increase the difficulty and complexity of the schedule. Operation conditions in chemical processes are certainly different from other types of processes. Therefore, in order to model the real-world environment on a chemical production process, a simulation model is built and it emulates the feasibility requirements of such a production system. The results of the model, i.e., the makespan and the workload of the most loaded tank, are necessary for providing insights about which schedule on the shop floor should be implemented. A new biobjective optimization method is proposed, and it uses the results mentioned above in order to build new scenarios for the MHSP and to solve the aforementioned conflicting objectives. Various numerical experiments are shown to illustrate the performance of this new experimental technique, i.e., the simulation optimization approach. Based on the results, the proposed scheme tackles the inconvenience of the metaheuristics, i.e., lack of diversity of the solutions and poor ability of exploitation. In addition, the optimization approach is able to identify the best solutions by a distance-based ranking model and the solutions located in the first Pareto-front layer contributes to improve the search process of the aforementioned scheme, against other algorithms used in the comparison.<\/jats:p>","DOI":"10.1155\/2021\/6639769","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T19:36:28Z","timestamp":1625686588000},"page":"1-22","source":"Crossref","is-referenced-by-count":0,"title":["Simulation Optimization for the Multihoist Scheduling Problem"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7401-9669","authenticated-orcid":true,"given":"Ricardo","family":"P\u00e9rez-Rodr\u00edguez","sequence":"first","affiliation":[{"name":"CONACYT-UAQ, Autonomous University of Queretaro, Faculty of Engineering, Centro Universitario, Cerro de las Campanas s\/n, 76010, Santiago de Queretaro, Mexico"}]}],"member":"311","reference":[{"article-title":"Improving the productivity of electroplating lines by changing the layout of the tanks","author":"C. Varnier","key":"1","doi-asserted-by":"crossref","DOI":"10.1109\/ETFA.1995.496797"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-it-1002.02827"},{"key":"3","first-page":"656","article-title":"A Unified PSO-based method for multi-hoist scheduling in advanced Galvanic plants","volume":"2020","author":"D. Ramin","year":"2020","journal-title":"CoDIT"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-it-1002.03153"},{"key":"5","first-page":"1473","article-title":"Optimization with constraint logic programming: the hoist scheduling problem solved with various solvers","volume-title":"Transactions on Information and Communications Technologies","author":"P. Baptiste","year":"1993"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.036"},{"volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","year":"2001","author":"P. Larra\u00f1aga","key":"7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.2307\/2333244"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1986.tb01420.x"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1988.10478679"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-5759-x"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1080\/002075497194804"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2004.12.008"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2006.12.031"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.03.007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2012.10.016"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.03.013"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.06.004"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-444-63428-3.50212-5"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2016.07.023"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2016.07.025"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ces.2017.04.022"},{"key":"23","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.cie.2018.04.046","article-title":"Cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints","volume":"120","author":"F. Jianguang","year":"2018","journal-title":"Computers & Industrial Engineering"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-it-1002.03372"},{"first-page":"581","article-title":"Dynamic hoist scheduling problem on real-life electroplating production line","author":"K. Kujawski","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.08.039"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107225"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/s0360-8352(97)00254-4"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/s0377-2217(01)00329-0"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/s1874-8651(10)60086-5"},{"first-page":"351","article-title":"Genetic algorithm for a cyclic Hoist Scheduling Problem with time-window constraints and heterogeneous part jobs","author":"A. El Amraoui","key":"31"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2013.02.004"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/3064724"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.3182\/20090603-3-ru-2001.0412"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.3182\/20120523-3-ro-2023.00428"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.022"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.011"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.10.006"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-444-63428-3.50326-x"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2016.01.020"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2017.04.039"},{"key":"42","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2017.12.011","article-title":"A sustainable aggregate production planning model for the chemical process industry","volume":"94","author":"G. J. Hahn","year":"2017","journal-title":"Computers & Operations Research"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.10.028"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2018.02.224"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1080\/10798587.2013.786963"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1687952"},{"first-page":"1469","article-title":"Simulation-based optimization model and metaheuristic solution of multiple crane scheduling problems","author":"H. Tamaki","key":"47"},{"first-page":"2633","article-title":"Simulation-based overhead-crane scheduling for a manufacturing plant","author":"T. Zhang","key":"48"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.12.014"},{"article-title":"A job shop scheduling approach based on simulation optimization","author":"Y. Yan","key":"50","doi-asserted-by":"crossref","DOI":"10.1109\/IEEM.2007.4419506"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1160-z"},{"key":"52","first-page":"1577","article-title":"Solving job-shop scheduling problems by genetic algorithm","volume-title":"International Journal of Computational Science and Mathematics","author":"M. Gen"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1016\/s0378-4754(02)00019-8"},{"first-page":"285","article-title":"Consensus ranking under the exponential model","author":"M. Meil\u0103","key":"54"},{"author":"R. Sargent","key":"55","article-title":"Verification & validation of simulation models"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.391"},{"key":"57","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963"},{"volume-title":"Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement)","year":"1984","author":"S. Lawrence","key":"58"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.149"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.10.1495"},{"first-page":"281","article-title":"A genetic algorithm applicable to large-scale job-shop problems","author":"T. Yamada","key":"61"},{"key":"62","article-title":"MIMIC: finding optima by estimation probability densities","volume":"9","author":"J. De Bonet","year":"1997","journal-title":"Advances in Neural Information Processing Systems"},{"first-page":"30","article-title":"Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space","author":"S. Baluja","key":"63"},{"volume-title":"Linkage Problem, Distribution Estimation, and Bayesian Networks","year":"1998","author":"M. Pelikan","key":"64"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"67","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.1986.289288"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/6639769.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/6639769.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2021\/6639769.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T19:36:43Z","timestamp":1625686603000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2021\/6639769\/"}},"subtitle":[],"editor":[{"given":"Mehdi","family":"Keshavarz-Ghorabaee","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":67,"alternative-id":["6639769","6639769"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6639769","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"type":"electronic","value":"1687-9732"},{"type":"print","value":"1687-9724"}],"subject":[],"published":{"date-parts":[[2021,7,6]]}}}