{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T01:55:39Z","timestamp":1761789339594},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T00:00:00Z","timestamp":1493769600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Council (TW)","award":["MOST104-2221-E-018-007"],"award-info":[{"award-number":["MOST104-2221-E-018-007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11227-017-2041-7","type":"journal-article","created":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T04:16:46Z","timestamp":1493785006000},"page":"4711-4738","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Reconstructing permutation table to improve the Tabu Search for the PFSP on GPU"],"prefix":"10.1007","volume":"73","author":[{"given":"Kai-Cheng","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsun","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-Chin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,3]]},"reference":[{"key":"2041_CR1","doi-asserted-by":"crossref","unstructured":"Fung J, Tang F, Mann S (2002) Mediated reality using computer graphics hardware for computer vision. In: Proceedings of the International Symposium on Wearable Computing 2002, 83\u201389","DOI":"10.1109\/ISWC.2002.1167222"},{"key":"2041_CR2","doi-asserted-by":"crossref","unstructured":"Fung J, Mann S (2004) Computer vision signal processing on graphics processing units. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, pp V-93\u2013V-96","DOI":"10.1109\/ICASSP.2004.1327055"},{"key":"2041_CR3","unstructured":"Abi-Chahla F (2015) Nvidia\u2019s CUDA: The End of the CPU?. Tom\u2019s Hardware"},{"issue":"2","key":"2041_CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1504\/IJBDI.2016.077385","volume":"3","author":"I Zouaneb","year":"2016","unstructured":"Zouaneb I, Belarbi M, Chouarfia A (2016) Multi approach for real-time systems specification: case study of GPU parallel systems. Int J Big Data Intell 3(2):122\u2013141","journal-title":"Int J Big Data Intell"},{"issue":"3","key":"2041_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1504\/IJBDI.2015.070596","volume":"2","author":"DP Playne","year":"2015","unstructured":"Playne DP, Hawick KA (2015) Benchmarking multi-GPU communication using the shallow water equations. Int J Big Data Intell 2(3):157\u2013167","journal-title":"Int J Big Data Intell"},{"issue":"1","key":"2041_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/ijghpc.2014010101","volume":"6","author":"CC Wu","year":"2014","unstructured":"Wu CC, Ke JY, Lin H, Jhan SS (2014) Adjusting thread parallelism dynamically to accelerate dynamic programming with irregular workload distribution on GPGPUs. Int J Grid High Perform Comput (IJGHPC) 6(1):1\u201320","journal-title":"Int J Grid High Perform Comput (IJGHPC)"},{"key":"2041_CR7","doi-asserted-by":"crossref","unstructured":"Novoa C, Qasem A, Chaparala A (2015) A SIMD tabu search implementation for solving the quadratic assignment problem with GPU acceleration. In: Proceedings of the 2015 XSEDE Conference: Scientific Advancements Enabled by Enhanced Cyberinfrastructure, pp 13","DOI":"10.1145\/2792745.2792758"},{"key":"2041_CR8","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.jpdc.2011.02.006","volume":"71","author":"M Czapi\u0144ski","year":"2011","unstructured":"Czapi\u0144ski M, Barnes S (2011) Tabu search with two approaches to parallel flowshop evaluation on CUDA platform. J Parallel Distrib Comput 71:802\u2013811","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"2041_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1(1):61\u201368","journal-title":"Naval Res Logist Q"},{"issue":"2","key":"2041_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson D, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"3","key":"2041_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0925-5273(02)00234-7","volume":"79","author":"C-S Chung","year":"2002","unstructured":"Chung C-S, Flynn J, Kirca O (2002) A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. Int J Prod Econ 79(3):185\u2013196","journal-title":"Int J Prod Econ"},{"issue":"6","key":"2041_CR12","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1016\/j.engappai.2011.09.001","volume":"25","author":"J Bautista","year":"2012","unstructured":"Bautista J, Canoa A, Companys R, Ribasb I (2012) Solving the Fm\n                        $$\\mid $$\n                        \n                            \n                                            \n                                \u2223\n                            \n                        \n                    block\n                        $$\\mid $$\n                        \n                            \n                                            \n                                \u2223\n                            \n                        \n                    C\n                        $$_{max}$$\n                        \n                            \n                                            \n                                \n                                    \n                                    \n                                        m\n                                        a\n                                        x\n                                    \n                                \n                            \n                        \n                     problem using bounded dynamic programming. Eng Appl Artif Intell 25(6):1235\u20131245","journal-title":"Eng Appl Artif Intell"},{"key":"2041_CR13","doi-asserted-by":"publisher","unstructured":"Ren T, Zhao P, Zhang D, Liu B, Yuan H, Bai D (2016) Permutation flow-shop scheduling problem to optimize a quadratic objective function. Eng Optim. doi:\n                        10.1080\/0305215X.2016.1261127","DOI":"10.1080\/0305215X.2016.1261127"},{"issue":"3","key":"2041_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R Gangadharan","year":"1993","unstructured":"Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ 32(3):285\u2013290","journal-title":"Int J Prod Econ"},{"issue":"3","key":"2041_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1504\/IJDATS.2014.063062","volume":"6","author":"N Santos","year":"2014","unstructured":"Santos N, Rebelo R, Pedroso J (2014) A tabu search for the permutation flow shop problem with sequence dependent setup times. Int J Data Anal Tech Strateg 6(3):275\u2013285","journal-title":"Int J Data Anal Tech Strateg"},{"issue":"3","key":"2041_CR16","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao J, Chen R, Dong W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641\u2013651","journal-title":"Int J Prod Res"},{"issue":"1","key":"2041_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/00207540701523041","volume":"47","author":"R Rajkumar","year":"2009","unstructured":"Rajkumar R, Shahabudeen P (2009) An improved genetic algorithm for the flowshop scheduling problem. Int J Prod Res 47(1):233\u2013249","journal-title":"Int J Prod Res"},{"key":"2041_CR18","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.procs.2013.05.259","volume":"18","author":"P Jaros\u0142aw","year":"2013","unstructured":"Jaros\u0142aw P, Czes\u0142aw S, Dominik \u017b (2013) Optimizing bicriteria flow shop scheduling problem by simulated annealing algorithm. Proc Comput Sci 18:936\u2013945","journal-title":"Proc Comput Sci"},{"issue":"7","key":"2041_CR19","doi-asserted-by":"crossref","first-page":"7970","DOI":"10.1016\/j.eswa.2010.12.075","volume":"38","author":"X Xu","year":"2011","unstructured":"Xu X, Xu Z, Gu X (2011) An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization. Expert Syst Appl 38(7):7970\u20137979","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2041_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.advengsoft.2011.12.001","volume":"47","author":"M Banka","year":"2012","unstructured":"Banka M, Ghomia SMTF, Jolai F, Behnamian J (2012) Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration. Adv Eng Softw 47(1):1\u20136","journal-title":"Adv Eng Softw"},{"issue":"2","key":"2041_CR21","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadiza","year":"2012","unstructured":"Ahmadiza F (2012) A new ant colony algorithm for makespan minimization in permutation flow shops. Comput Ind Eng 63(2):355\u2013361","journal-title":"Comput Ind Eng"},{"key":"2041_CR22","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.cie.2016.03.008","volume":"95","author":"W Bo\u017cejko","year":"2016","unstructured":"Bo\u017cejko W, Uchro\u0144ski M, Wodeck M (2016) Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput Ind Eng 95:156\u2013163","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2041_CR23","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1016\/j.cie.2010.08.003","volume":"59","author":"M Czapi\u0144ski","year":"2010","unstructured":"Czapi\u0144ski M (2010) Parallel simulated annealing with genetic enhancement for flowshop problem with C\n                        $$_{sum}$$\n                        \n                            \n                                            \n                                \n                                    \n                                    \n                                        s\n                                        u\n                                        m\n                                    \n                                \n                            \n                        \n                    . Comput Ind Eng 59(4):778\u2013785","journal-title":"Comput Ind Eng"},{"issue":"5","key":"2041_CR24","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.jpdc.2009.01.009","volume":"69","author":"W Bo\u017cejko","year":"2009","unstructured":"Bo\u017cejko W (2009) Solving the flow shop problem by parallel programming. J Parallel Distrib Comput 69(5):470\u2013481","journal-title":"J Parallel Distrib Comput"},{"issue":"2\u20133","key":"2041_CR25","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","volume":"106","author":"E Nowicki","year":"1998","unstructured":"Nowicki E, Smutnicki C (1998) The flow shop with parallel machines: a tabu search approach. Eur J Oper Res 106(2\u20133):226\u2013253","journal-title":"Eur J Oper Res"},{"issue":"14","key":"2041_CR26","first-page":"2416","volume":"14","author":"A Janiak","year":"2008","unstructured":"Janiak A, Janiak WA, Lichtenstein M (2008) Tabu Search on GPU. J UCS 14(14):2416\u20132426","journal-title":"J UCS"},{"issue":"3","key":"2041_CR27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.5267\/j.dsl.2014.2.004","volume":"3","author":"M Kaviani","year":"2014","unstructured":"Kaviani M, Abbasi M, Rahpeyma B, Yusefi M (2014) A hybrid tabu search-simulated annealing method to solve quadratic assignment problem. Decis Sci Lett 3(3):391\u2013396","journal-title":"Decis Sci Lett"},{"key":"2041_CR28","doi-asserted-by":"crossref","unstructured":"Pattnaik A, Tang X, Jog A, Kayiran O, Mishra AK, Kandemir MT, Mutlu O, Das CR (2016) Scheduling techniques for GPU architectures with processing-in-memory capabilities. In: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, pp 31\u201344","DOI":"10.1145\/2967938.2967940"},{"key":"2041_CR29","doi-asserted-by":"crossref","unstructured":"Han TD, Abdelrahman TS (2011) Reducing branch divergence in GPU programs. In: Proceedings of 4th Workshop on General Purpose Processing on Graphics Processing Units, pp 1\u20138","DOI":"10.1145\/1964179.1964184"},{"issue":"2","key":"2041_CR30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MM.2008.31","volume":"28","author":"E Lindholm","year":"2008","unstructured":"Lindholm E, Nickolls J, Oberman S, Montrym J (2008) NVIDIA Tesla: a unified graphics and computing architecture. IEEE Micro 28(2):39\u201355","journal-title":"IEEE Micro"},{"key":"2041_CR31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cageo.2011.08.007","volume":"41","author":"F Lu","year":"2012","unstructured":"Lu F, Song J, Cao X, Zhu X (2012) CPU\/GPU computing for long-wave radiation physics on large GPU clusters. Comput Geosci 41:47\u201355","journal-title":"Comput Geosci"},{"key":"2041_CR32","unstructured":"Nvidia CUDA (2017) CUDA C Programming Guide. \n                        http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf"},{"key":"2041_CR33","unstructured":"Nvidia CUDA (2017) CUDA C BEST PRACTICES GUIDE. \n                        http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Best_Practices_Guide.pdf"},{"issue":"3","key":"2041_CR34","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"Y-F Liu","year":"2011","unstructured":"Liu Y-F, Liu S-Y (2011) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput 13(3):1459\u20131463","journal-title":"Appl Soft Comput"},{"key":"2041_CR35","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.cie.2015.04.009","volume":"85","author":"Q Lin","year":"2015","unstructured":"Lin Q, Gao L, Li X, Zhang C (2015) A hybrid backtracking search algorithm for permutation flow-shop. Comput Ind Eng 85:437\u2013446","journal-title":"Comput Ind Eng"},{"issue":"3","key":"2041_CR36","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"2041_CR37","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"2041_CR38","doi-asserted-by":"crossref","unstructured":"Huang L-T, Jhan S-S, Li Y-J, Wu C.C (2014) Solving the permutation problem efficiently for tabu search on CUDA GPUs. In: Proceedings of 6th International Conference on Computational Collective Intelligence Technologies and Applications, pp 342\u2013352","DOI":"10.1007\/978-3-319-11289-3_35"},{"key":"2041_CR39","first-page":"13","volume":"6","author":"C-C Wu","year":"2016","unstructured":"Wu C-C, Wei K-C, Lai W-S, Li Y-J (2016) Avoiding duplicated computation to improve the performance of PFSP on CUDA GPUs. Comput Sci Inform Technol 6:13\u201323","journal-title":"Comput Sci Inform Technol"},{"key":"2041_CR40","doi-asserted-by":"crossref","unstructured":"Fung WWL, Sham I, Yuan G, Aamodt TM (2007) Dynamic warp formation and scheduling for efficient GPU control flow. In: Proceedings of the 40th Annual IEEE\/ACM International Symposium on Microarchitecture, pp 407\u2013420","DOI":"10.1109\/MICRO.2007.30"},{"issue":"2","key":"2041_CR41","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2041-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2041-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2041-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,18]],"date-time":"2017-10-18T05:34:13Z","timestamp":1508304853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2041-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,3]]},"references-count":41,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2041"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2041-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,3]]}}}