PETRI-NET BASED ALGORITHM FOR SOLVING MULTIMODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMS
This paper introduces a Petri net based approach for solving the multimode resource constrained project scheduling problem. The aim is to find a schedule that minimizes makespan considering renewable and non-renewable resources constrains and alternative modes to complete the activities of a project. Petri Nets are known for their power to model asynchronous, concurrent, and complex discrete-event dynamic manufacturing systems. Most of the optimization work with Petri Nets has been devoted to manufacturing systems but there is little evidence of research on project scheduling. This paper proposes an algorithm that combines the classical A* search method with a node-pruning strategy and limited backtracking cope with the state explosion. The results are very promising in both solution quality and computer times.
PetriNets A*Search Multi-mode Resource Constraint Project Scheduling.
Carlos Montoya Adriana Solano Gonzalo Mejía
Department of Industrial EngineeringUniversidad de Los Andes, Bogotá, Colombia Department of Industrial Engineering Universidad de Los Andes, Bogotá, Colombia
国际会议
上海
英文
1-6
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）