Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound.
Amir Ahmadi-JavidMaryam HaghiPedram Hooshangi-TabriziPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- branch and bound
- job shop scheduling
- constraint programming
- column generation
- branch and bound algorithm
- branch and bound procedure
- combinatorial optimization
- search algorithm
- combinatorial optimization problems
- job shop scheduling problem
- integer program
- lower bound
- constraint satisfaction problems
- combinatorial problems
- search space
- optimal solution
- scheduling problem
- search strategies
- constraint propagation
- upper bound
- constraint satisfaction
- linear program
- integer programming
- valid inequalities
- graph coloring
- tree search
- beam search
- global constraints
- cutting plane algorithm
- metaheuristic
- constraint networks
- arc consistency
- mixed integer
- search heuristics
- resource constraints
- traveling salesman problem
- cutting plane
- tabu search
- mathematical programming
- temporal constraints
- np hard