This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two
resource demand transmissions cannot use the same edge in the same time period.
An exact solution approach based on Dantzig-Wolfe decomposition is proposed along with several heuristics. The methods are computationally evaluated on test instances arising from telecommunications with up to
500 jobs and 500 machines. Results show that solving the problem to optimality is very difficult. The proposed heuristics have good performance with an average solution value gap of 3% and with very small running times.
|Place of Publication||Kgs. Lyngby|
|Number of pages||21|
|Publication status||Published - 2010|
|Series||DTU Management 2010|
- grid computing
- job scheduling
- routing and wavelength assignment
- network routing