Sciweavers

206 search results - page 17 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 2 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
ISPA
2007
Springer
14 years 1 months ago
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
TWC
2008
141views more  TWC 2008»
13 years 7 months ago
Bursty transmission and glue pouring: on wireless channels with overhead costs
Power efficiency is a capital issue in the study of mobile wireless nodes owing to constraints on their battery size and weight. In practice, especially for low-power nodes, it is ...
Pamela Youssef-Massaad, Lizhong Zheng, Muriel M&ea...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay