Skip to main content

and
  1. No Access

    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...

    Yuan Gao, **jiang Yuan, Zhigang Wei in Journal of Scheduling (2019)