Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Unbounded parallel-batch scheduling with drop-line tasks
In this paper, we study unbounded parallel-batch scheduling with drop-line tasks to minimize a regular objective function, where by “drop-line tasks” we mean that the completion time of each task (job) is equa...