Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

الملخص EN

We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs.

The starting time of each job of the first agent is related to the amount of resource consumed.

The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound U.

The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.