Online Over Time Scheduling on Parallel-Batch Machines: A Survey | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …

We study the problem of on-line scheduling jobs with release dates on a batch machine of
finite capacity with the objective of minimizing the makespan. We generalize several existing …

We consider online scheduling on m parallel-batch machines to minimize the makespan
where the batch capacity is unbounded. The processing time of a job becomes known only …

We consider the online scheduling of incompatible job families on an unbounded parallel-
batch machine to minimize the makespan, where jobs arrive over time and the number of job …

We study an on-line single parallel-batch machine scheduling problem where each job has
a processing time and a delivery time. Jobs arrive over time and the batch capacity is …

In this paper, we study on-line scheduling problems on a batch machine with the assumption
that all jobs have their processing times in p,(1+ φ) p, where p> 0 and ϕ=(5-1)/2. Jobs arrive …

We consider the online scheduling of incompatible unit-length job families on an unbounded
parallel-batch machine with lookahead. In this paper online means that jobs arrive over time …

We consider the online (over time) scheduling on a single unbounded parallel-batch
machine with job processing time compatibilities to minimize makespan. In the problem, a …

We consider the online (over time) scheduling problem of minimizing the makespan on m
unbounded parallel-batch machines, in which jobs in the same batch have to be pairwise …

We consider online scheduling on m unbounded parallel-batch machines to minimize
maximum flow-time of the jobs. We show that no online algorithm can have a competitive …