Variable neighborhood search for the single machine scheduling problem to minimize the total early work.
Rachid BenmansourRaca TodosijevicSaïd HanafiPublished in: Optim. Lett. (2023)
Keyphrases
- single machine scheduling problem
- variable neighborhood search
- branch and bound algorithm
- processing times
- sequence dependent setup times
- single machine
- precedence constraints
- search procedure
- lagrangian relaxation
- combinatorial optimization
- tabu search
- resource consumption
- traveling salesman problem
- response time
- heuristic methods
- scheduling problem
- lower bound
- optimal solution