Characterization of all ρ-approximated sequences for some scheduling problems.
Jean-Charles BillautPierre LopezPublished in: ETFA (2011)
Keyphrases
- scheduling problem
- processing times
- sequencing problems
- hidden markov models
- single machine
- np hard
- sequential patterns
- flowshop
- job shop
- parallel machines
- tabu search
- variable length
- precedence constraints
- limited capacity
- long sequences
- setup times
- earliness tardiness
- quay crane
- greedy heuristics
- sequence alignment
- test sequences
- job shop scheduling
- biological sequences
- neural network
- video sequences
- data mining