The 3-dimensional searchlight scheduling problem.
Giovanni VigliettaMaurizio MongePublished in: CCCG (2010)
Keyphrases
- scheduling problem
- single machine
- flowshop
- np hard
- permutation flowshop
- setup times
- tabu search
- processing times
- multi dimensional
- earliness tardiness
- job shop scheduling problem
- minimizing makespan
- precedence constraints
- total tardiness
- limited capacity
- dimensional data
- unrelated parallel machines
- maximum lateness
- release dates
- configuration space
- decision trees
- parallel machines
- multiscale