Task Scheduling with limited Resources

We already looked at a simple scheduling problem: Task Scheduling.

Here we are looking at a more elaborated scheduling example with limited resources for tasks with various durations. We want to get insights by re-engineering the solution of ¹ with Pyomo.

Problem

• We have \(N\) tasks and \(M\) facilities to execute the tasks.
• Every task has a due date.
• Tasks require certain resources for execution, e.g. water, electricity, …
• Every facility provides a set of resources
• Only one task per resource can be executed at a given time.

Assign the tasks to the facilities so that the task get all required resources for execution. We want to minimize the total time to complete all tasks. This time is called makespan.