Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm.
Asmaa KhoudiAli BerrichiPublished in: Oper. Res. (2020)
Keyphrases
- single machine scheduling problem
- branch and bound algorithm
- release dates
- minimize total
- bi objective
- sequence dependent setup times
- weighted tardiness
- efficient solutions
- lower bound
- optimal solution
- precedence constraints
- multi objective
- branch and bound
- single machine
- upper bound
- ant colony optimization
- np hard
- setup times
- knapsack problem
- combinatorial optimization
- lagrangian relaxation
- processing times
- scheduling problem
- metaheuristic
- evolutionary algorithm
- search space
- search algorithm
- objective function
- particle swarm optimization
- heuristic methods
- column generation
- search procedure
- linear program