Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach.
Adlane BaazizHacène Aït HaddadèneAmmar OulamaraAhmed KouiderPublished in: Int. J. Math. Oper. Res. (2023)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- minimize total
- sequence dependent setup times
- total tardiness
- earliness tardiness
- precedence constraints
- single machine
- release dates
- processing times
- flowshop
- weighted tardiness
- identical parallel machines
- scheduling jobs
- setup times
- makespan minimization
- total weighted tardiness
- maximum lateness
- np hard
- list scheduling
- parallel machine scheduling problem
- open shop
- job shop scheduling
- single server
- strongly np hard
- job shop scheduling problem
- tabu search
- shared memory
- scheduling algorithm
- special case
- lower bound
- identical machines
- optimal solution
- parallel computing
- lot sizing
- evolutionary algorithm