• Publications
  • Influence
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TLDR
The state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory are surveyed. Expand
Complexity of machine scheduling problems
TLDR
A classification of scheduling problems on single, different and identical machines is given and NP-completeness is established for a large number of other machine scheduling problems. Expand
Approximation algorithms for scheduling unrelated parallel machines
TLDR
It is proved that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP, and a complexity classification for all special cases with a fixed number of processing times is obtained. Expand
Scheduling subject to resource constraints: classification and complexity
TLDR
A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification. Expand
Sequencing and scheduling: algorithms and complexity
TLDR
This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops. Expand
Job Shop Scheduling by Simulated Annealing
TLDR
An approximation algorithm based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems, that can find shorter makespans than two recent approximation approaches that are more tailored to the job shop scheduling problem. Expand
Deterministic Production Planning: Algorithms and Complexity
A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functionsExpand
Complexity of vehicle routing and scheduling problems
TLDR
The complexity of a class of vehicle routing and scheduling problems is investigated and known NP-hardness results are reviewed and compiled to compile the worst-case performance of approximation algorithms. Expand
Approximation Algorithms for Scheduling Unrelated Parallel Machines
TLDR
It is proved that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unless P = NP, and a complexity classification for all special cases with a fixed number of processing times is obtained. Expand
Local Search in Combinatorial Optimisation.
TLDR
This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science. Expand
...
1
2
3
4
5
...