An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

Abstract

This paper studies online scheduling on an unbounded drop-line parallel batch machine with delivery times and limited restarts. A drop-line parallel batch machine is a system that can process some jobs simultaneously as a batch. Jobs in a batch have the same starting time and the completion time of a job is equal to its starting time plus its processing time. Limited restarts mean that a running batch containing at least one restarted job cannot be restarted again. The objective is to minimize the time by which all jobs have been delivered. We prove that any online algorithm has a competitive ratio of at least [Formula: see text], where [Formula: see text] is the positive solution of the equation [Formula: see text]. We provide a best possible [Formula: see text]-competitive online algorithm for the problem. Furthermore, we study the restricted problem with small delivery times and provide a best possible online algorithm with a competitive ratio of [Formula: see text].