Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study.
B. Shahidi-ZadehReza Tavakkoli-MoghaddamAlireza Taheri MoghadamI. RastgarPublished in: Comput. Oper. Res. (2017)
Keyphrases
- batch processing machines
- maximum lateness
- bi objective
- scheduling problem
- single machine
- flowshop
- precedence constraints
- efficient solutions
- parallel machines
- sequence dependent setup times
- multi objective
- release dates
- processing times
- multiple objectives
- multi objective optimization
- tabu search
- np hard
- shortest path problem
- ant colony optimization
- network design
- setup times
- upper bound
- special case
- optimal solution
- optimization problems
- single machine scheduling problem
- computational complexity
- search algorithm