Comparing the minimum completion times of two longest-first scheduling-heuristics.
Rico WalterPublished in: Central Eur. J. Oper. Res. (2013)
Keyphrases
- completion times
- scheduling problem
- single machine
- release times
- open shop
- unrelated parallel machines
- shortest processing time
- single machine scheduling problem
- weighted sum
- processing times
- job shop
- absolute deviation
- flowshop
- release dates
- arrival times
- search algorithm
- resource consumption
- queue length
- parallel machines
- scheduling jobs
- precedence constraints
- tabu search
- upper bound
- scheduling algorithm
- linear combination
- np hard