A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization.
Roberto CordonePierre HosteinsGiovanni RighiniPublished in: INFORMS J. Comput. (2018)
Keyphrases
- single machine scheduling problem
- total tardiness
- branch and bound algorithm
- prize collecting
- sequence dependent setup times
- lower bound
- branch and bound
- setup times
- precedence constraints
- upper bound
- release dates
- np hard
- combinatorial optimization
- optimal solution
- lagrangian relaxation
- objective function
- response time
- neural network
- search space
- parallel machines
- single machine
- processing times