Polynomially solvable cases for scheduling deteriorating jobs with rejection.

Ming Liu Chengbin Chu

Published in: ICNSC (2013)

Keyphrases

deteriorating jobs
polynomially solvable
processing times
single machine
scheduling problem
release times
np hard
np complete
maximum lateness
special case
release dates
single machine scheduling problem
setup times
feasible solution
resource allocation
flowshop
evolutionary algorithm