Resource Leveling Using Petrinet and Memetic Approach
K. Raja and S. Kumanan
DOI : 10.3844/ajassp.2007.317.322
American Journal of Applied Sciences
Volume 4, Issue 5
The problem of scheduling activities dynamic for a project, within the available resources and adhering to precedence relationships is NP hard combinatorial. Traditional approaches and their extensions are limited in application for simultaneous scheduling of resources with leveling. Considering the need for improved modeling and scheduling techniques, this paper proposes the use of Petrinet based approach aided by memetic algorithm. Manufacturing projects involving either a single or multi resources can be optimally leveled and scheduled. The effectiveness of this approach is demonstrated with case studies.
© 2007 K. Raja and S. Kumanan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.