Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints.
Oliver HerrAsvin GoelPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- total tardiness
- resource constraints
- single machine scheduling problem
- sequence dependent setup times
- single machine
- release dates
- setup times
- branch and bound algorithm
- processing times
- scheduling problem
- combinatorial optimization
- release times
- special case
- precedence constraints
- temporal constraints
- routing problem
- lagrangian relaxation
- hybrid algorithm
- resource consumption
- parallel machines
- completion times
- flowshop
- np hard
- lower bound