Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net

From MaRDI portal
Revision as of 07:17, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1760793

DOI10.1155/2012/651310zbMath1251.90114DBLPjournals/jam/BarzegarMB12OpenAlexW2017957022WikidataQ58906342 ScholiaQ58906342MaRDI QIDQ1760793

Behnam Barzegar, Hossein Bozorgi, Homayun Motameni

Publication date: 15 November 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/651310




Related Items (3)



Cites Work




This page was built for publication: Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net