{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:31:37Z","timestamp":1736400697104,"version":"3.32.0"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.cor.2023.106473","type":"journal-article","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T08:32:42Z","timestamp":1699518762000},"page":"106473","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Deterministic constructive vN-NEH+<\/mml:mo><\/mml:math> algorithm to solve permutation flow shop scheduling problem with makespan criterion"],"prefix":"10.1016","volume":"162","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3201-0735","authenticated-orcid":false,"given":"Rados\u0142aw","family":"Puka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5707-7525","authenticated-orcid":false,"given":"Iwona","family":"Skalna","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9225-7123","authenticated-orcid":false,"given":"Jerzy","family":"Duda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7200-8640","authenticated-orcid":false,"given":"Adam","family":"Stawowy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.cor.2023.106473_b1","first-page":"15","article-title":"Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem","volume":"29","author":"Alekseeva","year":"2017","journal-title":"Concurr. Comput. Prac. Exper."},{"key":"10.1016\/j.cor.2023.106473_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104943","article-title":"Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: Application to the permutation flow shop problem","volume":"122","author":"Boufellouh","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b3","series-title":"Artificial Intelligence and Soft Computing - ICAISC 2004","first-page":"400","article-title":"Parallel genetic algorithm for minimizing total weighted completion time","author":"Bo\u017cejko","year":"2004"},{"key":"10.1016\/j.cor.2023.106473_b4","series-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","first-page":"334","article-title":"A new inter-island genetic operator for optimization problems with block properties","author":"Bo\u017cejko","year":"2006"},{"key":"10.1016\/j.cor.2023.106473_b5","doi-asserted-by":"crossref","first-page":"621","DOI":"10.4236\/jsea.2012.58071","article-title":"Parallelization of a branch and bound algorithm on multicore systems","volume":"5","author":"Chung","year":"2012","journal-title":"J. Softw. Eng. Appl."},{"issue":"12","key":"10.1016\/j.cor.2023.106473_b6","doi-asserted-by":"crossref","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","article-title":"An improved NEH-based heuristic for the permutation flowshop problem","volume":"35","author":"Dong","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b7","doi-asserted-by":"crossref","DOI":"10.1007\/s42452-020-03895-5","article-title":"A new memetic global and local search algorithm for solving hybrid flow shop with multiprocessor task scheduling problem","volume":"2","author":"Engin","year":"2020","journal-title":"SN Appl. Sci."},{"key":"10.1016\/j.cor.2023.106473_b8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","article-title":"On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem","volume":"45","author":"Fernandez-Viagas","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.cor.2014.08.004","article-title":"A new set of high-performing heuristics to minimise flowtime in permutation flowshops","volume":"53","author":"Fernandez-Viagas","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106473_b10","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":"Fernandez-Viagas","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00207540210161650","article-title":"Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem","volume":"41","author":"Framinan","year":"2003","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106473_b12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2023.106473_b13","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1287\/ijoc.2022.1193","article-title":"Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers","volume":"34","author":"Gmys","year":"2022","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2023.106473_b14","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2020.01.039","article-title":"A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem","volume":"284","author":"Gmys","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/j.cor.2023.106473_b16","series-title":"Data Structures, Near Neighbor Searches, and Methodology","article-title":"A theoretician\u2019s guide to the experimental analysis of algorithms","author":"Johnson","year":"1999"},{"key":"10.1016\/j.cor.2023.106473_b17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/itor.12028","article-title":"Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues","volume":"21","author":"Juan","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","article-title":"On the NEH heuristic for minimizing the makespan in permutation flow shops","volume":"35","author":"Kalczynski","year":"2007","journal-title":"Omega"},{"issue":"9","key":"10.1016\/j.cor.2023.106473_b19","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","article-title":"An improved NEH heuristic to minimize makespan in permutation flow shops","volume":"35","author":"Kalczynski","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.08.021","article-title":"An empirical analysis of the optimality rate of flow shop heuristics","volume":"198","author":"Kalczynski","year":"2009","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b21","first-page":"2999","article-title":"Heuristic algorithms for large flowshop scheduling problems","volume":"vol. 4","author":"Li","year":"2004"},{"key":"10.1016\/j.cor.2023.106473_b22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","article-title":"A new improved NEH heuristic for permutation flowshop scheduling problems","volume":"193","author":"Liu","year":"2017","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2023.106473_b23","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","article-title":"A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem","volume":"13","author":"Liu","year":"2013","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"10.1016\/j.cor.2023.106473_b24","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","article-title":"An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers","volume":"35","author":"Liu","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104965","article-title":"Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling","volume":"121","author":"Maassen","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2023.106473_b26","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.parco.2006.01.003","article-title":"Parallel cooperative meta-heuristics on the computational grid: A case study: The bi-objective flow-shop problem","volume":"32","author":"Melab","year":"2006","journal-title":"Parallel Comput."},{"key":"10.1016\/j.cor.2023.106473_b27","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Leroy, R., Melab, N., Tuyttens, D., 2014. A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium. pp. 1203\u20131212.","DOI":"10.1109\/IPDPS.2014.124"},{"key":"10.1016\/j.cor.2023.106473_b28","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","article-title":"The distributed permutation flowshop scheduling problem","volume":"37","author":"Naderi","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2023.106473_b29","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1057\/palgrave.jors.2601466","article-title":"A high quality solution constructive heuristic for flow shop sequencing","volume":"53","author":"Nagano","year":"2002","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/j.cor.2023.106473_b31","series-title":"Proceedings of the 2003 International Conference on Computational Science: PartIII","first-page":"548","article-title":"Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks","author":"Oguz","year":"2003"},{"issue":"3","key":"10.1016\/j.cor.2023.106473_b32","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TASE.2012.2219860","article-title":"A high performing memetic algorithm for the flowshop scheduling problem with blocking","volume":"10","author":"Pan","year":"2013","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2023.106473_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105296","article-title":"N-NEH\uff0b algorithm for solving permutation flow shop problem","volume":"132","author":"Puka","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b34","doi-asserted-by":"crossref","unstructured":"Puka, R., \u0141amasz, B., 2022. Using reversibility property to solve permutation flow shop scheduling problem by means of algorithms implementing N-list technique. In: Proceedings 10th Carpathial Logistics Congress. pp. 234\u2013239.","DOI":"10.37904\/clc.2022.4540"},{"key":"10.1016\/j.cor.2023.106473_b35","doi-asserted-by":"crossref","unstructured":"Puka, R., \u0141amasz, B., Skalna, I., 2022a. Improving N-NEH\uff0b algorithm by using Starting Point method. In: 2022 17th Conference on Computer Science and Intelligence Systems, FedCSIS. pp. 357\u2013361.","DOI":"10.15439\/2022F103"},{"key":"10.1016\/j.cor.2023.106473_b36","doi-asserted-by":"crossref","unstructured":"Puka, R., Skalna, I., \u0141amasz, B., 2022b. Swap Method to improve N-NEH\uff0b algorithm. In: 2022 International Conference on Electrical, Computer and Energy Technologies, ICECET. pp. 1\u20136.","DOI":"10.1109\/ICECET55527.2022.9872559"},{"issue":"2","key":"10.1016\/j.cor.2023.106473_b37","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","article-title":"New high performing heuristics for minimizing makespan in permutation flowshops","volume":"37","author":"Rad","year":"2009","journal-title":"Omega"},{"key":"10.1016\/j.cor.2023.106473_b38","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10479-011-1056-3","article-title":"Parallel hybrid heuristics for the permutation flow shop problem","volume":"199","author":"Ravetti","year":"2012","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2023.106473_b39","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1016\/j.cor.2010.02.006","article-title":"Comparing three-step heuristics for the permutation flow shop problem","volume":"37","author":"Ribas","year":"2010","journal-title":"Comput. Oper. Res."},{"issue":"125\u2013136","key":"10.1016\/j.cor.2023.106473_b40","article-title":"Evaluation of high performance constructive heuristics for the flow shop with makespan minimization","volume":"87","author":"Rossi","year":"2016","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"10.1016\/j.cor.2023.106473_b41","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":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b42","series-title":"New Directions for Operations Research in Manufacturing","first-page":"161","article-title":"The application of a parallel genetic algorithm to the n\/m\/P\/C max flowshop problem","author":"St\u00f6ppler","year":"1992"},{"issue":"1","key":"10.1016\/j.cor.2023.106473_b43","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106473_b44","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106473_b45","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.ejor.2007.11.049","article-title":"Cooperative metaheuristics for the permutation flowshop scheduling problem","volume":"193","author":"Vallada","year":"2009","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106473_b46","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":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2023.106473_b47","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","article-title":"Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics","volume":"35","author":"Vallada","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106473_b48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2014.11.011","article-title":"Handling ties in heuristics for the permutation flow shop scheduling problem","volume":"35","author":"Vasiljevic","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2023.106473_b49","series-title":"Parallel Processing and Applied Mathematics","first-page":"236","article-title":"Solving the flow shop problem by parallel simulated annealing","author":"Wodecki","year":"2001"},{"key":"10.1016\/j.cor.2023.106473_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105204","article-title":"Just-in-time scheduling for a distributed concrete precast flow shop system","volume":"129","author":"Xiong","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2023.106473_b51","first-page":"355","article-title":"A high-performing constructive heuristic for minimizing makespan in permutation flowshops","volume":"30","author":"Ying","year":"2013","journal-title":"J. Ind. Prod. Eng."},{"key":"10.1016\/j.cor.2023.106473_b52","first-page":"1","article-title":"A new job priority rule for the NEH-based heuristic to minimize makespan in permutation flowshops","author":"Zhang","year":"2023","journal-title":"Eng. Optim."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003374?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003374?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:49:17Z","timestamp":1736369357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823003374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":52,"alternative-id":["S0305054823003374"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106473","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deterministic constructive vN-NEH algorithm to solve permutation flow shop scheduling problem with makespan criterion","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106473","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106473"}}