Location of Repository

Constraint Programming for Complex Elastic Scheduling



Abstract. Elastic scheduling with alternative resources and precedence constraints is described in this paper. Each activity has defined a time window, in which the whole activity must be processed. The goal is to find a schedule minimizing costs on resources. First a special case of the problem is introduced, which deals only with one resource in the schedule. After that a model with more resources is introduced, where each activity has assigned exactly one resource. For this problem no polynomial algorithm is known. Finally a constraint satisfaction optimization model for alternative resources is described. This model uses constraint programming techniques such as edge finding and alternative resources modeling

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mff.cuni.cz/veda/ko... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.