A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times

European Journal of Operational Research

Volumn 133, Issue 1, 2001, Pages 183-189

  Gendreau, Michel ^a   Laporte, Gilbert ^a,b   Guimarães, Eduardo Morais ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Heuristics; Lower bounds; Machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; RANDOM NUMBER GENERATION; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

SEQUENCE DEPENDENT SETUP TIMES; TABU SEARCH ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0035899630     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00197-1     Document Type: Article

References (12)

1. Subgradient optimization
2. Linear assignment
3. The m-traveling salesman problem with minmax objective
4. A tabu search heuristic for the multiprocessor scheduling probem with sequence dependent setup times
5. Approximation algorithms for some routing problems
6. Optimization and approximation in deterministic sequencing and scheduling: A survey
7. A patching algorithm for the nonsymmetric traveling-salesman problem
8. A cutting planes algorithm for the m-salesmen problem