A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider the single-familiy scheduling problem with batching on a single machine, with a setup time and release times, under batch availability. We investigate the objective of minimizing the total flow time, in both the online and offline setting. For the online problem, we propose a 2-competitive algorithm for the case of identical processing times, and we prove a lower bound that comes close. With different processing times and job reordering, our lower bound shows that online algorithmsdoi:10.1007/s10878-007-9114-0 fatcat:qynv7mdwjnfkzjn3h6bv6ugboa