Scheduling tasks on unrelated machines: Large neighborhood improvement procedures

Journal of Heuristics

Volumn 7, Issue 6, 2001, Pages 519-531

  Sourd, Francis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Enumeration tree; Heuristic; Improvement procedures; Scheduling; Unrelated machines

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; LINEAR PROGRAMMING; SCHEDULING; SEARCH ENGINES; TREES (MATHEMATICS);

ENUMERATION TREE; LARGE NEIGHBORHOOD IMPROVEMENT PROCEDURES; UNRELATED MACHINES;

ALGORITHMS;

EID: 0035504128     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011960407575     Document Type: Article

References (14)

1. Algorithms for scheduling tasks on unrelated parallel processors
2. The pilot method: A strategy for heuristic repetition with application to the steiner problem in graphs
3. Optimization and approximation in deterministic sequencing and scheduling: A survey
4. Limited discrepancy search
5. On heuristic algorithms for scheduling independent tasks on nonidentical processors
6. Computing near-optimal schedules
7. Approximation algorithms for scheduling unrelated parallel machines
8. Interleaved depth-first search
9. A local search heuristic for unrelated machine scheduling with efficient neighborhood search
10. Analysis of a linear programming heuristic for scheduling unrelated parallel machines
11. Unrelated parallel machine scheduling using local search
12. Fiber-to-object assignment heuristics
13. Duality-based algorithms for scheduling unrelated parallel machines
14. Depth-bounded discrepancy search