Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints.
Oualid BenbrikRachid BenmansourAbdelhak ElidrissiAngelo SifalerasPublished in: MIC (1) (2024)
Keyphrases
- scheduling problem
- sequence dependent setup times
- single machine
- parallel machines
- total tardiness
- setup times
- flowshop
- total weighted tardiness
- precedence constraints
- single machine scheduling problem
- computational complexity
- maximum lateness
- constraint satisfaction
- tabu search
- branch and bound algorithm
- optimization problems
- lower and upper bounds
- lower bound
- release dates
- reinforcement learning