Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models.
Radoslaw RudekPublished in: Comput. Oper. Res. (2014)
Keyphrases
- single processor
- scheduling problem
- parallel machines
- single machine
- multi processor
- parallel architectures
- flowshop
- processing times
- parallel processors
- tabu search
- precedence constraints
- distributed memory
- np hard
- completion times
- maximum lateness
- massively parallel
- parallel computing
- job shop scheduling problem
- markov random field
- shared memory
- heuristic search
- release dates
- search algorithm