package operations_research.scheduling.rcpsp

Get desktop application:
View/edit binary Protocol Buffers messages

Used in: PerSuccessorDelays

• repeated int32 min_delays = 1

Used in: Task

• repeated PerRecipeDelays recipe_delays = 1

• repeated int64 start_of_task = 1

• repeated int32 selected_recipe_of_task = 2

• repeated Resource resources = 1

  Problem data.

• repeated Task tasks = 2

• bool is_consumer_producer = 3

  Problem type.

• bool is_resource_investment = 4

• bool is_rcpsp_max = 5

• int32 deadline = 6

  If set, it defines a strict date, and each task must finish before this.

• int32 horizon = 7

  Additional info stored in the source file. The horizon is a date where we are sure that all tasks can fit before it.

• int32 release_date = 8

  The release date is defined in the rcpsp base format, but is not used.

• int32 tardiness_cost = 9

  The tardiness cost is defined in the rcpsp base format, but is not used.

• int32 mpm_time = 10

  The mpm_time is defined in the rcpsp base format, but is not used. It is defined as the minimum makespan in case of interruptible tasks.

• int64 seed = 11

  Data used by the problem generator.

• string basedata = 12

• int32 due_date = 13

  The due date is defined in the rcpsp base format, but is not used.

• string name = 14

Used in: Task

• int32 duration = 1

  The duration of the task when this recipe is selected.

• repeated int32 demands = 2

  In the general case, demand must be >= 0. In the consumer/producer case, it can be < 0. Note that in this case, the tasks always have a duration of zero. Thus the effect of the demand (increase or decrease of the current usage) happens at the start of the task.

• repeated int32 resources = 3

  This parallel list indicates which resource index (in the main problem) the above demand corresponds to.

Used in: RcpspProblem

• int32 max_capacity = 1

  The max capacity of the cumulative.

• int32 min_capacity = 2

  This field is used only in the consumer/producer case. It states the minimum capacity that must be valid at each time point.

• bool renewable = 3

  Indicates if the resource is renewable, that is if a task demands d from this resource, then the available capacity decreases by d at the start of the task and increases by d at the end of the task.

• int32 unit_cost = 4

  If non zero, then each unit of capacity will incur a cost of unit_cost.

Used in: RcpspProblem

• repeated int32 successors = 1

  The indices of the successors tasks in the main problem.

• repeated Recipe recipes = 2

  The list of possible ways to execute the task.

• repeated PerSuccessorDelays successor_delays = 3

  If the current task has n successors and m recipes then this is an n x m matrix where each entry at line i is a vector with the same length as the number of recipes for the task successor[i]. If recipe m1 is chosen for the current task, and recipe m2 is chosen for its successor i, we have: start(current_task) + delay[i][m1][m2] <= start(successor_task).