{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T12:07:03Z","timestamp":1775477223610,"version":"3.50.1"},"reference-count":45,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education NRF South Korea","award":["NRF"],"award-info":[{"award-number":["NRF"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Industries have to produce high quality products with low cost because of the competitive environment and customer demand. To cope with the increasing demand of customized products at low cost, the concept of cellular manufacturing systems (CMS) has been introduced under the umbrella of lean manufacturing. Industries are facing three major problems in CMS; selection of product families, cell formation and products scheduling. This paper deals with the products scheduling problem in CMS. As it is a non-deterministic polynomial-time (NP) hard problem, a hybrid particle swarm optimization algorithm with Nawaz, Enscore, Ham-NEH (NEPSO) embedded with local search is proposed to find optimized sequence results for two conflicting performance measures (work in process and machine cell utilization). Here, particle swarm optimization (PSO) is integrated with an NEH algorithm to quickly achieve better optimal sequence. For this purpose, the solution obtained from the NEH algorithm is used as a seed for PSO optimization. A mathematical model is presented for conflicting performance measures; minimization of work in process (WIP) and maximization of average machine cell utilization. A case study of automotive manufacturing cells was conducted. Results of the NEPSO were compared with the existing method, standard PSO, genetic algorithm (GA), and NEH algorithm, showing that the NEPSO performed better in term of problem optimization of the cellular layouts.<\/jats:p>","DOI":"10.3390\/sym11060729","type":"journal-article","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:18:09Z","timestamp":1559042289000},"page":"729","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Hybrid Particle Swarm Algorithm for Products\u2019 Scheduling Problem in Cellular Manufacturing System"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2455-1336","authenticated-orcid":false,"given":"Qazi Salman","family":"Khalid","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, University of Engineering &amp; Technology, Peshawar P.O.B. 814, KPK, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9584-9522","authenticated-orcid":false,"given":"Muhammad","family":"Arshad","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Engineering &amp; Technology, Peshawar P.O.B. 814, KPK, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8355-1593","authenticated-orcid":false,"given":"Shahid","family":"Maqsood","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Engineering &amp; Technology, Peshawar P.O.B. 814, KPK, Pakistan"}]},{"given":"Mirza","family":"Jahanzaib","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Engineering &amp; Technology, Taxila 47080, Pakistan"}]},{"given":"Abdur Rehman","family":"Babar","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Engineering &amp; Technology, Peshawar P.O.B. 814, KPK, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8900-0888","authenticated-orcid":false,"given":"Imran","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, University of Engineering &amp; Technology, Peshawar P.O.B. 814, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6386-272X","authenticated-orcid":false,"given":"Jabir","family":"Mumtaz","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Digital Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science &amp; Technology, Wuhan 430074, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, University of Ulsan, Ulsan 44610, Korea"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1287\/mnsc.20.12.1561","article-title":"Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements","volume":"20","author":"Baker","year":"1974","journal-title":"Manag. Sci."},{"key":"ref_2","unstructured":"Baker, K.R. (1974). Introduction to Sequencing and Scheduling, John Wiley & Sons."},{"key":"ref_3","unstructured":"Conway, R.W., Maxwell, W.L., and Miller, L.W. (2012). Theory of Scheduling, Courier Corporation."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Swamidass, P.M. (2000). Encyclopedia of Production and Manufacturing Management, Springer Science & Business Media.","DOI":"10.1007\/1-4020-0612-8"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ham, I., Hitomi, K., and Yoshida, T. (1985). Production scheduling for group technology. Group Technology, Springer.","DOI":"10.1007\/978-94-009-4976-8_7"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1080\/09537289608930365","article-title":"Scheduling in flowshop and cellular manufacturing systems with multiple objectives\u2014A genetic algorithmic approach","volume":"7","author":"Sridhar","year":"1996","journal-title":"Prod. Plan. Control"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/002075497195966","article-title":"Cellular manufacturing at 46 user plants: implementation experiences and performance improvements","volume":"35","author":"Wemmerlov","year":"1997","journal-title":"Int. J. Prod. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1080\/00207549508930148","article-title":"A simulation analyses of factors influencing loading practices in cellular manufacturing","volume":"33","author":"Shafer","year":"1995","journal-title":"Int. J. Prod. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3445","DOI":"10.1080\/002075499190130","article-title":"Evaluation of manufacturing cell loading rules for independent cells","volume":"37","author":"Suer","year":"1999","journal-title":"Int. J. Prod. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0925-5273(91)90098-E","article-title":"Minimizing the makespan of a group scheduling problem: a new heuristic","volume":"22","author":"Logendran","year":"1991","journal-title":"Int. J. Prod. Econ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2005","DOI":"10.1080\/002075498193084","article-title":"A hierarchical model for the cell loading problem of cellular manufacturing systems","volume":"36","author":"Akturk","year":"1998","journal-title":"Int. J. Prod. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1080\/002075400189419","article-title":"A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell","volume":"38","author":"Schaller","year":"2000","journal-title":"Int. J. Prod. Res."},{"key":"ref_13","first-page":"1761","article-title":"The effects of setup time on output capacity in cellular manufacturing","volume":"25","author":"Flynn","year":"1987","journal-title":"Int. J. Prod. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2004.830335","article-title":"Guest Editorial Special Issue on Particle Swarm Optimization","volume":"8","author":"Eberhart","year":"2004","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hassan, R., Cohanim, B., De Weck, O., and Venter, G. (2005, January 21). A Comparison of Particle Swarm Optimization and the Genetic Algorithm. Proceedings of the 46th AIAA\/ASME\/ASCE\/AHS\/ASC Structures, Structural Dynamics and Materials Conference, Austin, TX, USA.","DOI":"10.2514\/6.2005-1897"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Liu, Y., Sun, A., Loh, H.T., Lu, W.F., and Lim, E.-P. (2008). Particle Swarm Optimization and Differential Evolution Algorithms: Technical Analysis, Applications and Hybridization Perspectives. Advances of Computational Intelligence in Industrial Systems, Springer.","DOI":"10.1007\/978-3-540-78297-1"},{"key":"ref_17","first-page":"287","article-title":"Multi-objective particle swarm optimizers: A survey of the state-of-the-art","volume":"2","author":"Coello","year":"2006","journal-title":"Int. J. Comput. Intell. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","article-title":"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem","volume":"177","author":"Tasgetiren","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","first-page":"120","article-title":"A particle swarm optimization and differential evolution algorithms for job shop scheduling problem","volume":"3","author":"Tasgetiren","year":"2006","journal-title":"J. Oper. Res."},{"key":"ref_20","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","author":"Xia","year":"2005","journal-title":"Comput. Ind. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/s00170-005-2513-4","article-title":"A hybrid particle swarm optimization approach for the job-shop scheduling problem","volume":"29","author":"Xia","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, T.D., Li, X., Chen, S.H., Wang, X., Abbass, H., Iba, H., Chen, G., and Yao, X. (2006). Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems. Simulated Evolution and Learning, Springer.","DOI":"10.1007\/11903697"},{"key":"ref_23","first-page":"4743","article-title":"Hybrid particle swarm optimization for flexible job-shop scheduling","volume":"19","author":"Jia","year":"2007","journal-title":"J. Syst. Simul."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1007\/s00170-003-1933-2","article-title":"Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm","volume":"25","author":"Jerald","year":"2005","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_25","unstructured":"Huang, D.-S., McGinnity, M., Heutte, L., and Zhang, X.-P. (2010). Multi-objective Particle Swarm Optimization for Sequencing and Scheduling a Cellular Manufacturing System. Advanced Intelligent Computing Theories and Applications, Springer."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-009-0130-z","article-title":"Flow shops with WIP and value added costs","volume":"13","author":"Yang","year":"2010","journal-title":"J. Schedul."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.cor.2009.06.016","article-title":"Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization","volume":"37","author":"Massim","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.36.2.229","article-title":"The Role of Work-in-Process Inventory in Serial Production Lines","volume":"36","author":"Conway","year":"1988","journal-title":"Oper. Res."},{"key":"ref_29","unstructured":"Yang, J. (2019, April 19). 7. Flow-shop Scheduling Problem with Weighted Work-In-Process. Available online: http:\/\/www.dbpia.co.kr\/journal\/articleDetail?nodeId=NODE00596702&language=ko_KR."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1080\/00207543.2013.828164","article-title":"A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints","volume":"52","author":"Zhang","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1007\/s10845-010-0395-2","article-title":"A cell formation problem considering machine utilization and alternative process routes by scatter search","volume":"23","author":"Amin","year":"2012","journal-title":"J. Intell. Manuf."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.amc.2007.01.060","article-title":"Designing a new mathematical model for cellular manufacturing system based on cell utilization","volume":"190","author":"Mahdavi","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1080\/09511920600667366","article-title":"A simulated annealing-based optimization approach for integrated process planning and scheduling","volume":"20","author":"Li","year":"2007","journal-title":"Int. J. Comput. Integrated Manuf."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Campos, J., and Silva, M. (1992). Structural techniques and performance bounds of stochastic Petri net models. Advances in Petri Nets, Springer.","DOI":"10.1007\/3-540-55610-9_178"},{"key":"ref_35","first-page":"16","article-title":"Dynamic weighted sum multi-criteria decision making: Mathematical Model","volume":"1","author":"Alanazi","year":"2013","journal-title":"Int. J. Math. Statistics Invent."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1109\/TII.2014.2316638","article-title":"A novel crowding genetic algorithm and its applications to manufacturing robots","volume":"10","author":"Chen","year":"2014","journal-title":"IEEE Trans. Ind. Inf."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.eswa.2017.12.011","article-title":"An efficient genetic algorithm for large-scale planning of dense and robust industrial wireless networks","volume":"96","author":"Gong","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","article-title":"A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks","volume":"8","author":"Ercan","year":"2005","journal-title":"J. Sched."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","article-title":"A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility","volume":"169","author":"Ruiz","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1080\/09537280050051942","article-title":"Genetic algorithm to production planning and scheduling problems for manufacturing systems","volume":"11","author":"Man","year":"2000","journal-title":"Prod. Plan. Control"},{"key":"ref_41","first-page":"1","article-title":"A comprehensive survey on particle swarm optimization algorithm and its applications","volume":"15","author":"Zhang","year":"2015","journal-title":"Math. Probl. Eng."},{"key":"ref_42","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.C., and Gencyilmaz, G. (2004, January 19\u201323). Particle swarm optimization algorithm for single machine total weighted tardiness problem. Proceedings of the 2004 Congress on Evolutionary Computation, Portland, OR, USA."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","article-title":"A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times","volume":"193","author":"Anghinolfi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TEVC.2009.2030331","article-title":"A novel set-based particle swarm optimization method for discrete optimization problems","volume":"14","author":"Chen","year":"2010","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1080\/0951192X.2015.1130247","article-title":"A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints","volume":"29","author":"Cui","year":"2016","journal-title":"Int. J. Comput. Integrated Manuf."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/6\/729\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:54:03Z","timestamp":1760187243000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/6\/729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":45,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["sym11060729"],"URL":"https:\/\/doi.org\/10.3390\/sym11060729","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,28]]}}}