Login / Signup
Three scheduling problems with deteriorating jobs to minimize the total completion time.
C. T. Ng
T. C. Edwin Cheng
Aleksander Bachman
Adam Janiak
Published in:
Inf. Process. Lett. (2002)
Keyphrases
</>
deteriorating jobs
scheduling problem
single machine
maximum lateness
tabu search
maximum tardiness
processing times
release times
flowshop
scheduling jobs
precedence constraints
setup times
minimizing makespan
np hard
single machine scheduling problem
release dates
strongly np hard