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
- weighted tardiness
- release dates
- single machine
- sequence dependent setup times
- branch and bound algorithm
- scheduling problem
- processing times
- parallel machines
- total cost
- setup times
- combinatorial optimization
- precedence constraints
- resource consumption
- tabu search
- lagrangian relaxation
- hybrid algorithm
- linear programming
- response time