论文部分内容阅读
We consider the following single machine online tradeoff scheduling problem.A set of n independent jobs arrive online over time.Each job Jj has a release date rj,a processing time pj and a delivery time qj.The characteristics of a job are unknown until it arrives.