乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T00:21:49Z","timestamp":1721866909138},"reference-count":21,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"vor","delay-in-days":268,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"In this study, a new mathematical model is presented to solve the flexible flow shop problem where transportation is reliable and there are constraints on intermediate buffers, budgets, and human resource learning effects. Firstly, the model is validated to confirm the accuracy of its performance. Then, since it is an NP\u2010hard one, two metaheuristic algorithms, namely, MOSA and MOEA\/D, are rendered to solve mid\u2010 and large\u2010scale problems. To confirm their accuracy of performance, two small\u2010scale problems are solved using GAMS exact solution software, and the obtained results have been compared with the output of the algorithms. Since the problem in this study is multiobjective, five comparative indices are used to compare the performance of algorithms. The results show that the answers achieved using the metaheuristic algorithms are very close to the ones achieved via the GAMS exact program. Therefore, the proposed algorithms are validated, and it is proved that they are accurately designed and useable in solving the real\u2010world problems (which have mid\u2010 and large\u2010scale) in logical calculation time. By comparing the obtained results, it can be seen that the MOEA\/D algorithm performs better in terms of computational time (CPU time) and Mean ideal distance (MID). The MOSA algorithm also performs better according to the index Spread of nondominated solutions (SNS), diversity metric (DM), and number of Pareto solutions (NPS). Considering the confirmation of precision and accuracy of performance of the proposed algorithms, it can be concluded that MOSA and MOEA\/D are useful in solving the mid\u2010 and large\u2010scale modes of the problem in the study, which is very applicable in the real world.<\/jats:p>","DOI":"10.1155\/2022\/1253336","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:50:06Z","timestamp":1664243406000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint"],"prefix":"10.1155","volume":"2022","author":[{"given":"Meysam","family":"Kazemi Esfeh","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0984-6622","authenticated-orcid":false,"given":"Amir Abbas","family":"Shojaie","sequence":"additional","affiliation":[]},{"given":"Hasan","family":"Javanshir","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2338-1673","authenticated-orcid":false,"given":"Kaveh","family":"Khalili-Damghani","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0969-6016(97)00042-7"},{"key":"e_1_2_8_2_2","first-page":"49","article-title":"Delay scheduling based on discrete-event simulation for construction projects","volume":"12","author":"Abolghasemian M.","year":"2021","journal-title":"Iranian Journal of Operations Research"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/9390768"},{"key":"e_1_2_8_4_2","first-page":"83","article-title":"Modelling and optimization of a tri-objective Transportation-Location-Routing Problem considering route reliability: using MOGWO, MOPSO, MOWCA and NSGA-II","volume":"14","author":"Maadanpour Safari F.","year":"2021","journal-title":"Journal of optimization in industrial engineering"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10668-022-02350-2"},{"key":"e_1_2_8_6_2","doi-asserted-by":"crossref","unstructured":"SalvadorM. S. A solution to a special class of flow shop scheduling problem Proceedings of the Symposium of the Theory of Scheduling and Applications 1973 New York NY USA 83\u201391.","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.2307\/2582115"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.06.001"},{"key":"e_1_2_8_10_2","article-title":"Scheduling hybrid flow shops with sequence dependent setup times to minimize makespan and maximum tardiness","volume":"34","author":"Naderi B.","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.09.013"},{"key":"e_1_2_8_12_2","article-title":"Solving Bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study","volume":"875","author":"Shahidizadeh R.","year":"2017","journal-title":"Computers & Operational Research"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600442"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.11.136"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1080\/17509653.2018.1505565"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105044"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107705"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107659"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2021.100180"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1002\/er.6332"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.11.008"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2022\/1253336.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2022\/1253336.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/1253336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T05:57:10Z","timestamp":1721800630000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/1253336"}},"subtitle":[],"editor":[{"given":"Reza","family":"Lotfi","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/1253336"],"URL":"https:\/\/doi.org\/10.1155\/2022\/1253336","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-07-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}