Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

Abstract EN

m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation.

The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost.

If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.