Login / Signup
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem.
Sunan Han
Dawei Hong
Joseph Y.-T. Leung
Published in:
INFORMS J. Comput. (1995)
Keyphrases
</>
asymptotic optimality
flowshop
makespan minimization
scheduling problem
processing times
special case
total weighted tardiness
shortest processing time
parallel machines
setup times
tabu search
sequence dependent setup times
single machine
search algorithm
asymptotically optimal
heuristic methods
job shop scheduling problem
job shop
precedence constraints
ant colony optimization
metaheuristic
polynomially solvable
multi objective
neural network