{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:49:55Z","timestamp":1769168995673,"version":"3.49.0"},"reference-count":30,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T00:00:00Z","timestamp":1345075200000},"content-version":"vor","delay-in-days":228,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in suitable time. In flexible job\u2010shop scheduling production systems, we could reduce time and costs by transferring and delivering operations on existing machines, that is, among NP\u2010hard problems. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by Makespan. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, new algorithm were proposed for flexible job\u2010shop scheduling problem systems (FJSSP\u2010GSPN) that is based on gravitational search algorithm (GSA). In the proposed method, the flexible job\u2010shop scheduling problem systems was modeled by color Petri net and CPN tool and then a scheduled job was programmed by GSA algorithm. The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.<\/jats:p>","DOI":"10.1155\/2012\/651310","type":"journal-article","created":{"date-parts":[[2012,8,17]],"date-time":"2012-08-17T21:01:49Z","timestamp":1345237309000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving Flexible Job\u2010Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net"],"prefix":"10.1155","volume":"2012","author":[{"given":"Behnam","family":"Barzegar","sequence":"first","affiliation":[]},{"given":"Homayun","family":"Motameni","sequence":"additional","affiliation":[]},{"given":"Hossein","family":"Bozorgi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,8,16]]},"reference":[{"key":"e_1_2_12_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238804"},{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023073"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00113-1"},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00012-F"},{"key":"e_1_2_12_6_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0305-0548(94)E0018-3","article-title":"Effective job shop scheduling through active chain manipulation","volume":"22","author":"Sun D.","year":"1995","journal-title":"Computers and Operations Research"},{"key":"e_1_2_12_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.6.797"},{"key":"e_1_2_12_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00158-7"},{"key":"e_1_2_12_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"e_1_2_12_10_2","unstructured":"KobayashiS. OnoI. andYamamuraM. EshelmanL. J. An efficient genetic algorithm for job shop scheduling problems Proceedings of the 6th International Conference on Genetic Algorithms 1995 San Francisco Calif USA Morgan Kaufman 506\u2013511."},{"key":"e_1_2_12_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.012"},{"key":"e_1_2_12_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00137-9"},{"key":"e_1_2_12_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-007-0026-8"},{"key":"e_1_2_12_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00002-5"},{"key":"e_1_2_12_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2005.01.018"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.02.014"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.001"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.007"},{"key":"e_1_2_12_20_2","doi-asserted-by":"crossref","unstructured":"DefershaF. M.andChenM. A coarse-grain parallel genetic algorithm for flexible job-shop scheduling with lot streaming Proceedings of the International Conference on Computational Science and Engineering (CSE \u203209) August 2009 201\u2013208 2-s2.0-70749156289 https:\/\/doi.org\/10.1109\/CSE.2009.401.","DOI":"10.1109\/CSE.2009.401"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"e_1_2_12_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.75415"},{"key":"e_1_2_12_23_2","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06289-0","volume-title":"Coloured Petri Nets Vol. 1: Basic Concepts","author":"Jensen K.","year":"1992"},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-007-0038-x"},{"key":"e_1_2_12_25_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.6.797"},{"key":"e_1_2_12_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00158-7"},{"key":"e_1_2_12_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00319-1"},{"key":"e_1_2_12_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.914753"},{"key":"e_1_2_12_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.12.035"},{"key":"e_1_2_12_30_2","article-title":"A hybrid particle swarm optimization algorithm for job-shop scheduling problem","volume":"3","author":"Cun-li S.","year":"2011","journal-title":"International Journal of Advancements in Computing Technology"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/651310.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/651310.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/651310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T06:55:38Z","timestamp":1718088938000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/651310"}},"subtitle":[],"editor":[{"given":"Nazim I.","family":"Mahmudov","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/651310"],"URL":"https:\/\/doi.org\/10.1155\/2012\/651310","archive":["Portico"],"relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"value":"1110-757X","type":"print"},{"value":"1687-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-12-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-14","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"651310"}}