A Cooperation-planning Model Based on Time Window Constraint (ID: 3-002)

摘要

This paper is based on a resource constrained active network project; the constraint of the local resource and time window constraint of the cooperation resource are considered simultaneously. And a cooperation-planning model is designed, according to the due time and total cost. And an extended CNP based on the permitted range for resource and time requests is presented. A larger task set in scheduling is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks. As a result, the optimization space for the cooperation planning is enlarged. Finally, the genetic algorithm is given and the validity and feasibility of the model is. Proved by a case.