Makespan Minimization of task graphs with random task running times.
Lucian FintaZhen LiuPublished in: Interconnection Networks and Mapping and Scheduling Parallel Computations (1994)
Keyphrases
- running times
- makespan minimization
- times faster
- scheduling problem
- job shop scheduling problem
- special case
- processing times
- lower bound
- parallel machines
- metaheuristic
- worst case
- flowshop
- polynomially solvable
- single machine
- np hard
- total weighted tardiness
- release dates
- setup times
- graph model
- np complete
- ant colony optimization
- job shop scheduling
- upper bound
- genetic algorithm
- optimization problems
- dynamic programming
- markov random field
- weighted graph
- graph structure
- simulated annealing