Kritischer Vergleich von Algorithmen für ein Scheduling-Problem.
Klaus EckerPublished in: GI Jahrestagung (1975)
Keyphrases
- scheduling problem
- single machine
- flowshop
- tabu search
- np hard
- permutation flowshop
- setup times
- minimizing makespan
- earliness tardiness
- processing times
- unrelated parallel machines
- databases
- total tardiness
- maximum lateness
- precedence constraints
- limited capacity
- parallel machines
- sequence dependent setup times
- job shop scheduling problem
- machine learning
- release dates
- linear programming
- search algorithm
- data structure
- e learning
- decision making