Find Paper, Faster
Example:10.1021/acsami.1c06204 or Chem. Rev., 2007, 107, 2411-2502
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Theoretical Computer Science  (IF0.827),  Pub Date : 2021-06-07, DOI: 10.1016/j.tcs.2021.06.002
Gyorgy Dosa, Hans Kellerer, Tomas Olaj, Zsolt Tuza

We consider the scheduling model with two identical machines and jobs which arrive online in a list and are assigned to the machines with the objective of minimizing the makespan. Differently from the pure online version, we know in advance a lower bound and also an upper bound on the total size of all jobs. Our algorithm improves previous results on some interval of r, where r is the ratio of the upper and lower bounds on the total size. For most ranges of r our algorithm is best possible. Our technique is based on a smart application of so-called “safe sets”.