Online Scheduling Problem With Delivery Times Of Jobs

In recent years, Online Scheduling Models with delivery times of jobs are pretty new, and applied widely in practice. In this paper, we study the online scheduling problem with delivery times of Jobs. We analyze the algorithm through the competitive ratio. For single parallel-batch machine scheduling problem with delivery times. We show that in this model any online algorithm has a competitive ratio no more than(?). Also we provide an on-line algorithm with competitive ratio (?), online 2 parallel-batch machine with delivery times.