Trimming-the-state-space mechanism embedded branch-and-bound algorithm for two-parallel machines scheduling with availability constraints.
Anh H. G. NguyenGwo-Ji SheenPublished in: Comput. Ind. Eng. (2024)
Keyphrases
- precedence constraints
- parallel machines
- branch and bound algorithm
- state space
- scheduling problem
- sequence dependent setup times
- release dates
- lower bound
- unrelated parallel machines
- single machine scheduling problem
- np hard
- upper bound
- branch and bound
- optimal solution
- setup times
- maximum lateness
- minimize total
- scheduling jobs
- parallel computing
- integer variables
- shared memory
- combinatorial optimization
- processing times
- single machine
- search space
- neural network
- reinforcement learning
- search algorithm
- global constraints
- random variables
- graphical models