A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem.
Ricardo C. CorrêaAfonso FerreiraPublished in: Euro-Par (1999)
Keyphrases
- scheduling problem
- np hard
- flowshop
- special case
- single machine
- approximation algorithms
- precedence constraints
- minimizing makespan
- branch and bound
- permutation flowshop
- data sets
- processing times
- earliness tardiness
- multiprocessor systems
- bounded treewidth
- setup times
- tabu search
- iterative procedure
- job shop scheduling problem
- preventive maintenance
- database machines
- strongly np hard
- search tree
- scheduling algorithm
- search space