Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph.
Yakov ZinderJoanna BerlinskaCharlie PeterPublished in: CoRR (2021)
Keyphrases
- parallel machines
- total weight
- scheduling problem
- total tardiness
- unrelated parallel machines
- earliness tardiness
- precedence constraints
- minimize total
- sequence dependent setup times
- weighted tardiness
- scheduling jobs
- parallel computing
- release dates
- open shop
- setup times
- identical parallel machines
- single machine
- single server
- flowshop
- shared memory
- multiscale
- search algorithm