Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work.
Issam KrimiRachid BenmansourRaca TodosijevicNenad MladenovicMustapha RatliPublished in: Optim. Lett. (2023)
Keyphrases
- minimize total
- single machine scheduling problem
- release dates
- weighted tardiness
- single machine
- sequence dependent setup times
- processing times
- scheduling problem
- branch and bound algorithm
- setup times
- parallel machines
- precedence constraints
- combinatorial optimization
- search procedure
- total cost
- resource consumption
- branch and bound
- lagrangian relaxation
- flowshop