Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem.
Giampiero ChiaselottiMaria Italia GualtieriPaolamaria PietramalaPublished in: J. Math. Model. Algorithms (2010)
Keyphrases
- parallel machine scheduling problem
- single machine
- scheduling problem
- parallel machines
- total weighted tardiness
- precedence constraints
- release dates
- sequence dependent setup times
- maximum lateness
- processing times
- single machine scheduling problem
- branch and bound algorithm
- setup times
- production scheduling
- tabu search
- np hard
- approximation algorithms
- parallel computing
- evolutionary algorithm
- job shop scheduling