A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates.
Thiago Henrique NogueiraHelena Ramalhinho Dias LourençoCarlos R. V. de CarvalhoMartín Gómez RavettiPublished in: Optim. Lett. (2022)
Keyphrases
- single machine scheduling problem
- sequence dependent setup times
- release dates
- processing times
- variable neighborhood search
- single machine
- total weighted tardiness
- combinatorial optimization
- branch and bound algorithm
- lagrangian relaxation
- minimize total
- setup times
- scheduling problem
- precedence constraints
- search procedure
- optimal solution
- lower bound
- resource consumption
- parallel machines
- upper bound
- column generation
- search algorithm
- branch and bound
- solution quality
- special case