{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T06:05:37Z","timestamp":1770617137210,"version":"3.49.0"},"reference-count":26,"publisher":"Emerald","issue":"12","license":[{"start":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T00:00:00Z","timestamp":1576713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K"],"published-print":{"date-parts":[[2019,12,19]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>With the continuous upgrading of the production mode of the manufacturing system, the characteristics of multi-variety, small batch and mixed fluidization are presented, and the production environment becomes more and more complex. To improve the efficiency of solving multi-objective flexible job shop scheduling problem (FJSP), an improved hybrid particle swarm optimization algorithm (IH-PSO) is proposed.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>After reviewing literatures on FJSP, an IH-PSO algorithm for solving FJSP is developed. First, IH-PSO algorithm draws on the crossover and mutation operations of genetic algorithm (GA) algorithm and proposes a new method for updating particles, which makes the offspring particles inherit the superior characteristics of the parent particles. Second, based on the improved simulated annealing (SA) algorithm, the method of updating the individual best particles expands the search scope of the domain and solves the problem of being easily trapped in local optimum. Finally, analytic hierarchy process (AHP) is used in this paper to solve the optimal solution satisfying multi-objective optimization.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>Through the benchmark experiment and the production example experiment, it is verified that the proposed algorithm has the advantages of high quality of solution and fast speed of convergence.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title>\n<jats:p>This method does not consider the unforeseen events that occur during the process of scheduling and cause the disruption of normal production scheduling activities, such as machine breakdown.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>IH-PSO algorithm combines PSO algorithm with GA and SA algorithms. This algorithm retains the advantage of fast convergence speed of traditional PSO algorithm and has the characteristic of inheriting excellent genes. In addition, the improved SA algorithm is used to solve the problem of falling into local optimum.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Social implications<\/jats:title>\n<jats:p>This research provides an efficient scheduling method for solving the FJSP problem.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>This research proposes an IH-PSO algorithm to solve the FJSP more efficiently and meet the needs of multi-objective optimization.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/k-06-2019-0430","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:08:20Z","timestamp":1579255700000},"page":"2873-2892","source":"Crossref","is-referenced-by-count":33,"title":["An improved hybrid particle swarm optimization for multi-objective flexible job-shop scheduling problem"],"prefix":"10.1108","volume":"49","author":[{"given":"Yi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Haihua","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Dunbing","family":"Tang","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"issue":"10","key":"key2020111314463516700_ref001","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1108\/K-12-2014-0293","article-title":"Priority-based task scheduling on heterogeneous resources in the expert cloud","volume":"44","year":"2015","journal-title":"Kybernetes"},{"key":"key2020111314463516700_ref002","first-page":"1","article-title":"An improved PSO algorithm for flexible job shop scheduling with lot splitting","year":"2009"},{"key":"key2020111314463516700_ref003","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cie.2016.11.001","article-title":"Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches","volume":"102","year":"2016","journal-title":"Computers and Industrial Engineering"},{"issue":"24","key":"key2020111314463516700_ref004","doi-asserted-by":"crossref","first-page":"9434","DOI":"10.1016\/j.eswa.2015.08.003","article-title":"Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem","volume":"42","year":"2015","journal-title":"Expert Systems with Applications"},{"key":"key2020111314463516700_ref005","first-page":"1587","article-title":"An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem","year":"2007"},{"issue":"1","key":"key2020111314463516700_ref006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","year":"2002","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)"},{"key":"key2020111314463516700_ref007","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.cie.2018.08.022","article-title":"A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and random-restart hill climbing","volume":"125","year":"2018","journal-title":"Computers and Industrial Engineering"},{"key":"key2020111314463516700_ref008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jss.2016.07.006","article-title":"An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: formal verification, simulation, and statistical testing","volume":"124","year":"2017","journal-title":"Journal of Systems and Software"},{"key":"key2020111314463516700_ref009","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","year":"2016","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"key2020111314463516700_ref010","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","article-title":"An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems","volume":"59","year":"2010","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"key2020111314463516700_ref011","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","article-title":"An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem","volume":"29","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"key":"key2020111314463516700_ref012","first-page":"29","article-title":"An effective particle swarm optimization to solve flexible job shop scheduling problem","volume-title":"Presented at the 5th IESM conference in Morocco: Rabat, 2013","year":"2013"},{"key":"key2020111314463516700_ref013","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.jpdc.2017.05.001","article-title":"New scheduling approach using reinforcement learning for heterogeneous distributed systems","volume":"117","year":"2018","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"10","key":"key2020111314463516700_ref014","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"35","year":"2008","journal-title":"Computers and Operations Research"},{"issue":"1\/4","key":"key2020111314463516700_ref015","first-page":"303","article-title":"An effective artificial bee colony algorithm for the flexible job-shop scheduling problem","volume":"60","year":"2012","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"key2020111314463516700_ref016","doi-asserted-by":"crossref","first-page":"45","DOI":"10.3901\/JME.2018.09.045","article-title":"Energy-saving oriented multi-objective shop floor scheduling for mixed-line production of missile","volume":"54","year":"2018","journal-title":"Journal of Mechanical Engineering"},{"issue":"2","key":"key2020111314463516700_ref017","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","article-title":"An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems","volume":"48","year":"2005","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"key2020111314463516700_ref018","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10845-015-1137-2","article-title":"A new immune multi-agent system for the flexible job shop scheduling problem","volume":"29","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"key2020111314463516700_ref019","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","article-title":"Multi-objective flexible job shop scheduling using memetic algorithms","volume":"12","year":"2015","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"12","key":"key2020111314463516700_ref020","doi-asserted-by":"crossref","first-page":"3688","DOI":"10.1080\/00207543.2014.881575","article-title":"Coupling a genetic algorithm with the distributed arrival-time control for the JIT dynamic scheduling of flexible job-shops","volume":"52","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"4","key":"key2020111314463516700_ref022","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","article-title":"An effective genetic algorithm for the flexible job-shop scheduling problem","volume":"38","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"key2020111314463516700_ref021","doi-asserted-by":"crossref","first-page":"156","DOI":"10.3901\/JME.2010.11.156","article-title":"Improved NSGA-II for the multi-objective flexible job-shop scheduling problem","volume":"46","year":"2010","journal-title":"Journal of Mechanical Engineering"},{"issue":"4","key":"key2020111314463516700_ref023","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","article-title":"An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem","volume":"56","year":"2009","journal-title":"Computers and Industrial Engineering"},{"issue":"12","key":"key2020111314463516700_ref024","first-page":"3231","article-title":"Optimization method of flexible job-shop scheduling problem based on niching and particle swarm optimization algorithms","volume":"21","year":"2015","journal-title":"Computer Integrated Manufacturing Systems"},{"key":"key2020111314463516700_ref025","doi-asserted-by":"crossref","first-page":"125113","DOI":"10.1109\/ACCESS.2019.2938548","article-title":"An adaptive real-time scheduling method for flexible job shop scheduling problem with combined processing constraint","volume":"7","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"key2020111314463516700_ref026","first-page":"677","article-title":"Adaptive multimeme algorithm for flexible job shop scheduling problem","volume":"16","year":"2016","journal-title":"Natural Computing"}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-06-2019-0430\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-06-2019-0430\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:48:48Z","timestamp":1753393728000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/49\/12\/2873-2892\/457258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,19]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12,19]]}},"alternative-id":["10.1108\/K-06-2019-0430"],"URL":"https:\/\/doi.org\/10.1108\/k-06-2019-0430","relation":{},"ISSN":["0368-492X","0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"},{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12,19]]}}}