MILP models to minimise makespan in additive manufacturing machine scheduling problems.

Ibrahim Kucukkoc

Published in: Comput. Oper. Res. (2019)

Keyphrases

scheduling problem
flowshop
processing times
single machine
minimizing makespan
parallel machines
batch processing
strongly np hard
permutation flowshop
special case
unrelated parallel machines
lower bound
complex systems
linear program
knapsack problem
scheduling jobs