A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects.
Yunqiang YinWen-Hung WuWen-Hsiang WuChin-Chia WuPublished in: Inf. Sci. (2014)
Keyphrases
- single machine
- release dates
- single machine scheduling problem
- branch and bound algorithm
- scheduling problem
- precedence constraints
- minimize total
- sequence dependent setup times
- processing times
- total weighted tardiness
- earliness tardiness
- maximum lateness
- release times
- scheduling jobs
- lower bound
- np hard
- branch and bound
- parallel machines
- combinatorial optimization
- setup times
- upper bound
- dynamic programming
- reinforcement learning
- shortest processing time
- resource consumption
- lagrangian relaxation
- search procedure
- evolutionary algorithm
- optimal solution