On The Capacitated Scheduling Problem with Conflict Jobs.
Minh Hoàng HàDuy Manh VuYakov ZinderTrung ThanhPublished in: KSE (2019)
Keyphrases
- scheduling problem
- flowshop
- np hard
- setup times
- processing times
- permutation flowshop
- lot sizing
- multi item
- total tardiness
- unrelated parallel machines
- sequence dependent setup times
- parallel machines
- single machine
- precedence constraints
- identical parallel machines
- earliness tardiness
- parallel machine scheduling problem
- minimizing makespan
- strongly np hard
- total weighted tardiness
- release dates
- tabu search
- identical machines
- conflict resolution
- maximum lateness
- vehicle routing problem
- limited capacity
- facility location
- optimal scheduling
- multi source
- completion times
- scheduling jobs
- randomly generated test problems
- single source
- approximation algorithms
- job shop
- single machine scheduling problem
- job shop scheduling problem
- minimum cost
- multistage
- upper bound
- single item
- lagrangian relaxation
- integer programming
- lower bound
- vehicle routing problem with stochastic demands
- network design problem
- list scheduling
- computational complexity