On Permutation Representations for Scheduling Problems.
Christian BierwirthDirk C. MattfeldHerbert KopferPublished in: PPSN (1996)
Keyphrases
- scheduling problem
- squeaky wheel
- processing times
- single machine
- flowshop
- job shop scheduling problem
- setup times
- np hard
- data sets
- earliness tardiness
- job shop
- genetic algorithm
- tabu search
- parallel machines
- higher level
- sequencing problems
- real time
- learning algorithm
- symbolic representation
- precedence constraints
- job shop scheduling
- simulated annealing
- greedy heuristics
- reinforcement learning
- special case