{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:48:51Z","timestamp":1760888931484},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T00:00:00Z","timestamp":1409788800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2014,10]]},"abstract":"<jats:p>The flow shop scheduling problem based on ideal and precise conditions has been a focus of considerable research since the first easy scheduling problem was formulated. In reality, some uncertain factors always restrict the scheduling optimisation problem. In this paper, taking uncertain processing time as an example, we use generalised rough sets theory to transform the rough flow shop scheduling model into the precise scheduling model. We adopt a cooperative co-evolutionary particle swarm optimisation algorithm based on a niche sharing scheme (NCPSO) to minimise the makespan in comparison with the particle swarm optimiser (PSO) and co-evolution particle swarm optimiser (CPSO) algorithms. The new algorithm is characterised by a strengthening of the ability to reserve excellent particles and searching the optimal solution. Experimental results show that the new algorithm is more effective and efficient than the others.<\/jats:p>","DOI":"10.1017\/s0960129512000461","type":"journal-article","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T00:08:51Z","timestamp":1409875731000},"source":"Crossref","is-referenced-by-count":2,"title":["A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty"],"prefix":"10.1017","volume":"24","author":[{"given":"BIN","family":"JIAO","sequence":"first","affiliation":[]},{"given":"SHAOBIN","family":"YAN","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"key":"S0960129512000461_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"S0960129512000461_ref20","first-page":"3369","article-title":"Flow Shop Scheduling Problem under Uncertainty Based on Generalized Rough Sets","volume":"18","author":"Yu","year":"2006","journal-title":"Journal of System Simulation"},{"key":"S0960129512000461_ref12","first-page":"115","article-title":"A Novel Particle Swarm Optimization for Flow Shop Scheduling with Fuzzy Processing Time.","volume":"25","author":"Niu","year":"2008","journal-title":"Journal of Donghua University"},{"key":"S0960129512000461_ref5","unstructured":"Goldberg D. and Richardson J. (1987) Genetic algorithms with sharing for multimodal function optimization. In: Proceedings International Conference Genetic Algorithms 41\u201349."},{"key":"S0960129512000461_ref15","doi-asserted-by":"crossref","unstructured":"Petrowski A. (1996) A clearing procedure as a niching method for genetic algorithms. In: Proceedings of IEEE International Conference on Evolutionary Computation 798\u2013803.","DOI":"10.1109\/ICEC.1996.542703"},{"key":"S0960129512000461_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(98)00283-8"},{"key":"S0960129512000461_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"S0960129512000461_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(90)90191-L"},{"key":"S0960129512000461_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/91.649907"},{"key":"S0960129512000461_ref6","first-page":"37","article-title":"Massive multimodality, deception and genetic algorithms","volume":"2","author":"Goldberg","year":"1992","journal-title":"Proceedings Parallel Problem Solving from Nature"},{"key":"S0960129512000461_ref17","doi-asserted-by":"publisher","DOI":"10.1109\/4235.735432"},{"key":"S0960129512000461_ref14","volume-title":"Rough Sets \u2013 Theoretical Aspects of Reasoning about Data","author":"Pawlak","year":"1991"},{"key":"S0960129512000461_ref4","doi-asserted-by":"crossref","unstructured":"Gan J. and Warwick K. (2001) Dynamic niche clustering: a fuzzy variable radius niching technique for multimodal optimisation in GAs. In: Proceedings of IEEE Congress on Evolutionary Computation 215\u2013222.","DOI":"10.1109\/CEC.2001.934392"},{"key":"S0960129512000461_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6384-9_42"},{"key":"S0960129512000461_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(00)00066-9"},{"key":"S0960129512000461_ref18","first-page":"185","article-title":"A Genetic Algorithm for Single Machine Scheduling with Fuzzy Processing Time and Multiple Objectives.","volume":"21","author":"Wu","year":"2004","journal-title":"Journal of Donghua University"},{"key":"S0960129512000461_ref21","first-page":"1427","article-title":"Parallel machines scheduling with uncertain processing time based on rough programming.","volume":"23","author":"Yu","year":"2008","journal-title":"Control and Decision"},{"key":"S0960129512000461_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(79)90022-8"},{"key":"S0960129512000461_ref19","first-page":"480","article-title":"Earliness and tardiness flow shop scheduling problems under uncertainty with finite intermediate storage.","volume":"23","author":"Xu","year":"2006","journal-title":"Control Theory Applications"},{"key":"S0960129512000461_ref7","first-page":"322","article-title":"Earliness\/Tardiness Flow Shop Production Scheduling under Uncertainty within Finite Intermediate Storage.","volume":"30","author":"Gu","year":"2004","journal-title":"Journal of East China University of Science and Technology"},{"key":"S0960129512000461_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0952-1976(01)00011-2"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129512000461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:22:36Z","timestamp":1555892556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129512000461\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["S0960129512000461"],"URL":"https:\/\/doi.org\/10.1017\/s0960129512000461","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,4]]},"article-number":"e240502"}}