Approximation algorithms for batch scheduling with processing set restrictions.

Online scheduling on a single machine with linear deteriorating processing times and delivery times.

On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times.

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine.

The medical laboratory scheduling for weighted flow-time.

A best possible on-line algorithm for scheduling on uniform parallel-batch machines.

Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan.

Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time.