Scheduling problems with unreliable jobs and machines.
Alessandro AgnetisPaolo DettiPatrick MartineauPublished in: CTW (2011)
Keyphrases
- scheduling problem
- flowshop
- identical machines
- parallel machines
- parallel machine scheduling problem
- identical parallel machines
- processing times
- single machine
- total tardiness
- setup times
- sequence dependent setup times
- precedence constraints
- earliness tardiness
- np hard
- maximum lateness
- minimizing makespan
- permutation flowshop
- tabu search
- release dates
- job scheduling
- total weighted tardiness
- unrelated parallel machines
- high multiplicity
- strongly np hard
- job shop scheduling
- special case
- list scheduling
- job shop
- minimize total
- scheduling decisions
- limited capacity
- greedy heuristics
- job shop scheduling problem
- optimal scheduling
- simulated annealing
- lower bound
- deteriorating jobs
- computational complexity