An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes.
Omid ShahvariRasaratnam LogendranPublished in: Comput. Oper. Res. (2017)
Keyphrases
- completion times
- scheduling problem
- unrelated parallel machines
- bicriteria
- tabu search algorithm
- tabu search
- lower bound
- job shop scheduling problem
- flowshop
- single machine
- np hard
- processing times
- setup times
- precedence constraints
- upper bound
- online algorithms
- strongly np hard
- parallel machines
- job shop
- objective function
- release dates
- scheduling jobs
- feasible solution
- memetic algorithm
- single machine scheduling problem
- test instances
- optimal solution
- heuristic methods
- hybrid algorithm
- branch and bound algorithm
- np complete
- approximation algorithms
- vehicle routing problem
- solution quality
- global optimization
- branch and bound
- lagrangian relaxation
- knapsack problem
- batch processing
- metaheuristic
- linear programming
- simulated annealing
- special case