Estimating the Makespan of the Two-Valued Restricted Assignment Problem.

Klaus Jansen Kati Land Marten Maack

Published in: Algorithmica (2018)

Keyphrases

np hard
scheduling problem
lower bound
batch processing
release dates
rigid body
processing times
optimal solution
single machine
minimizing makespan
database
upper bound
computer vision
artificial intelligence
genetic algorithm
neural network
data sets