An Approximation Result for a Duo-Processor Task Scheduling Problem.

Paolo Dell'Olmo Stefano Giordani Maria Grazia Speranza

Published in: Inf. Process. Lett. (1997)

Keyphrases

scheduling problem
high speed
single machine
np hard
tabu search
special case
parallel processing
real time
lower bound
search space
flowshop
multiprocessor systems
minimizing makespan