On polynomial solvability of two multiprocessor scheduling problems.
Eberhard GirlichAlexander G. TarnowskiPublished in: Math. Methods Oper. Res. (1999)
Keyphrases
- scheduling problem
- flowshop
- single machine
- processing times
- setup times
- job shop scheduling
- np hard
- tabu search
- job shop scheduling problem
- precedence constraints
- greedy heuristics
- job shop
- sequencing problems
- earliness tardiness
- low order
- parallel machines
- highly parallel
- single processor
- multiprocessor systems
- limited capacity