MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem.
Andrea BaloghMichele GarraffaBarry O'SullivanFabio SalassaPublished in: Comput. Oper. Res. (2022)
Keyphrases
- search procedures
- permutation flowshop
- scheduling problem
- flowshop
- sequence dependent setup times
- linear program
- search procedure
- tabu search
- single machine
- strongly np hard
- search strategies
- np hard
- search algorithm
- upper bound
- setup times
- search methods
- precedence constraints
- metaheuristic
- parallel machines
- processing times
- routing problem
- search space
- feasible solution
- satisfiability problem
- greedy algorithm
- constraint satisfaction problems
- release dates
- single machine scheduling problem
- response time
- linear programming
- game tree
- simulated annealing
- branch and bound algorithm
- optimal solution
- ant colony optimization