Lagrangian Relaxation for Multiprocessor Task Scheduling Problem with Variable Job Profiles

Abstract

In this paper the multiprocessor task scheduling problem with variable job profile is addressed. Such problem originates from many practical resource assignment contexts. Based on discretized parameters, the problem is formulated as an integer programming model. Due to the complexity of the problem, a Lagrangian relaxation is applied to solve the problem. The numerical experiment demonstrates the effectiveness of our algorithm procedure.