SIAM Journal on Computing
Optical Switching and Networking Handbook
Optical Switching and Networking Handbook
Routing and wavelength assignment methods in single-hop all-optical networks with blocking
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Intelligent Scheduling and Replication in Datagrids: a Synergistic Approach
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Scheduling scientific workflow applications in computational grids
Scheduling scientific workflow applications in computational grids
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
DECO: data replication and execution CO-scheduling for utility grids
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
Hi-index | 0.04 |
This paper examines the 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 has a certain demand, which must be sent to the executing machine via constrained paths. A job cannot start before all its demands have arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through an optical network. The problem is formulated as an IP problem and is shown to be NP-hard. An exact solution approach based on Dantzig-Wolfe decomposition is proposed. Also, several heuristic methods are developed by combining heuristics for the job scheduling problem and for the constrained network routing problem. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results show that solving the integrated job scheduling and constrained network routing problem to optimality is very difficult. The exact solution approach performs better than using a standard IP-solver; however, it is still unable to solve several instances. The proposed heuristics generally have good performance. Especially, the First Come First Serve scheduling heuristic combined with a routing strategy, which proposes several good routes for each demand, has good performance with an average solution value gap of 3%. All heuristics have very small running times.