Scheduling identical jobs on uniform machines with a conflict graph.
Amin MallekMohamed BendraoucheMourad BoudharPublished in: Comput. Oper. Res. (2019)
Keyphrases
- identical machines
- identical parallel machines
- parallel machines
- scheduling problem
- processing times
- fixed number
- flowshop
- scheduling jobs
- wafer fabrication
- single machine
- job scheduling
- unrelated parallel machines
- precedence constraints
- release dates
- sequence dependent setup times
- parallel machine scheduling problem
- setup times
- scheduling decisions
- minimize total
- maximum lateness
- release times
- strongly np hard
- single server
- optimal scheduling
- manufacturing cell
- scheduling algorithm
- total weighted tardiness
- polynomial time approximation
- weighted tardiness
- list scheduling
- deteriorating jobs
- scheduling strategy
- parallel computing
- competitive ratio
- precedence relations
- tabu search
- job shop scheduling
- approximation algorithms
- np hard
- information technology
- support vector