Scheduling to minimize maximum lateness on unequal parallel processors.
Prabuddha DeThomas E. MorionPublished in: Comput. Oper. Res. (1982)
Keyphrases
- precedence constraints
- maximum lateness
- parallel processors
- scheduling problem
- release dates
- branch and bound algorithm
- parallel machines
- sequence dependent setup times
- single machine
- batch processing machines
- approximation algorithms
- partial order
- global constraints
- single machine scheduling problem
- setup times
- partially ordered
- np hard
- flowshop
- processing times
- search problems
- tabu search
- combinatorial optimization
- heuristic search
- upper bound
- contract algorithms