Maximum cost scheduling of jobs with mixed variable processing times and $$k$$ -partite precedence constraints.
Marek DebczynskiPublished in: Optim. Lett. (2014)
Keyphrases
- precedence constraints
- processing times
- scheduling problem
- release dates
- job processing times
- precedence relations
- single machine
- single machine scheduling problem
- identical machines
- flowshop
- scheduling decisions
- setup times
- identical parallel machines
- maximum lateness
- parallel machines
- sequence dependent setup times
- scheduling jobs
- makespan minimization
- np hard
- branch and bound algorithm
- total weighted tardiness
- resource consumption
- number of tardy jobs
- approximation algorithms
- partial order
- job shop scheduling problem
- job shop
- polynomially solvable
- tabu search
- release times
- worst case performance ratio
- total cost
- partially ordered
- lagrangian relaxation
- computational complexity
- competitive ratio