Login / Signup
Exact algorithms to minimize makespan on single and parallel batch processing machines.
Ibrahim Muter
Published in:
Eur. J. Oper. Res. (2020)
Keyphrases
</>
exact algorithms
batch processing machines
knapsack problem
maximum lateness
approximation algorithms
lower bound
combinatorial optimization
combinatorial optimization problems
exact solution
max sat
search algorithm
special case
single machine
parallel computing
combinatorial problems