Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Scatter search and path relinking
New ideas in optimization
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality
International Journal of Ad Hoc and Ubiquitous Computing
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem
Computers and Industrial Engineering
| Hi-index | 0.00 |
We consider the generalization of the classical P‖Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.