{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:35:00Z","timestamp":1773866100776,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T00:00:00Z","timestamp":1519603200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2016-00069"],"award-info":[{"award-number":["MYRG2016-00069"]}],"id":[{"id":"10.13039\/501100004733","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Macao FDCT","award":["FDCT\/126\/2014\/A3"],"award-info":[{"award-number":["FDCT\/126\/2014\/A3"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00500-018-3075-3","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T03:45:10Z","timestamp":1519616710000},"page":"6025-6034","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Solving permutation flow-shop scheduling problem by rhinoceros search algorithm"],"prefix":"10.1007","volume":"22","author":[{"given":"Suash","family":"Deb","sequence":"first","affiliation":[]},{"given":"Zhonghuan","family":"Tian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1848-7246","authenticated-orcid":false,"given":"Simon","family":"Fong","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Raymond","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Nilanjan","family":"Dey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,26]]},"reference":[{"issue":"1","key":"3075_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10745-006-9083-4","volume":"35","author":"CT Brown","year":"2007","unstructured":"Brown CT, Liebovitch LS, Glendon R (2007) L\u00e9vy flights in Dobe Ju\/\u2019hoansi foraging patterns. Hum Ecol 35(1):129\u2013138","journal-title":"Hum Ecol"},{"issue":"10","key":"3075_CR2","doi-asserted-by":"publisher","first-page":"B-630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   job, \n                    \n                      \n                    \n                    $$m$$\n                    \n                      \n                        m\n                      \n                    \n                   machine sequencing problem. Manag Sci 16(10):B-630","journal-title":"Manag Sci"},{"issue":"11","key":"3075_CR3","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1007\/s00500-013-1199-z","volume":"18","author":"C-L Chen","year":"2014","unstructured":"Chen C-L, Huang S-Y, Tzeng Y-R, Chen C-L (2014) Revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18(11):2271\u20132282","journal-title":"Soft Comput"},{"key":"3075_CR4","doi-asserted-by":"crossref","unstructured":"Deb S, Fong S, Tian Z (2015) Elephant search algorithm for optimization problems. In: 2015 10th international conference on digital information management (ICDIM). IEEE, pp 249\u2013255","DOI":"10.1109\/ICDIM.2015.7381893"},{"issue":"2","key":"3075_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"4","key":"3075_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"SK Iyer","year":"2004","unstructured":"Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593\u2013606","journal-title":"Comput Oper Res"},{"issue":"1","key":"3075_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2003.816583","volume":"8","author":"CY Lee","year":"2004","unstructured":"Lee CY, Yao X (2004) Evolutionary programming using mutations based on the L\u00e9vy probability distribution. IEEE Trans Evol Comput 8(1):1\u201313","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"3075_CR8","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"Y-F Liu","year":"2013","unstructured":"Liu Y-F, Liu S-Y (2013) 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":"3075_CR9","volume-title":"Operations and production systems with multiple objectives","author":"B Malakooti","year":"2013","unstructured":"Malakooti B (2013) Operations and production systems with multiple objectives. Wiley, London"},{"issue":"7","key":"3075_CR10","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00500-013-0992-z","volume":"17","author":"Y Marinakis","year":"2013","unstructured":"Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159\u20131173","journal-title":"Soft Comput"},{"issue":"1","key":"3075_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \n                    \n                      \n                    \n                    $$m$$\n                    \n                      \n                        m\n                      \n                    \n                  -machine, \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"1","key":"3075_CR12","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160\u2013175","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3075_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"DS Palmer","year":"1965","unstructured":"Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum. J Oper Res Soc 16(1):101\u2013107","journal-title":"J Oper Res Soc"},{"issue":"2","key":"3075_CR14","doi-asserted-by":"publisher","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 Ope Res 64(2):278\u2013285","journal-title":"Eur J Ope Res"},{"issue":"3","key":"3075_CR15","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF et al (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"issue":"15","key":"3075_CR16","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1007\/s00500-016-2062-9","volume":"21","author":"H Wang","year":"2017","unstructured":"Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297\u20134307","journal-title":"Soft Comput"},{"issue":"2","key":"3075_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M Widmer","year":"1989","unstructured":"Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41(2):186\u2013193","journal-title":"Eur J Oper Res"},{"issue":"5","key":"3075_CR18","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"K-C Ying","year":"2004","unstructured":"Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791\u2013801","journal-title":"Comput Oper Res"},{"key":"3075_CR19","first-page":"1","volume":"21","author":"F Zou","year":"2016","unstructured":"Zou F, Chen D, Lu R, Wang P (2016) Hierarchical multi-swarm cooperative teaching-learning-based optimization for global optimization. Soft Comput 21:1\u201322","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3075-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3075-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3075-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T20:50:22Z","timestamp":1551127822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3075-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,26]]},"references-count":19,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["3075"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3075-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,26]]},"assertion":[{"value":"26 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and Animal Rights"}}]}}