This paper addresses a single-machine scheduling problem in which the processed jobs are delivered in batch forms. This problem has been recently formulated based on some key assumptions. The main contribution of the current paper is shedding light on the validity of the previous formulations and assumptions. Furthermore, a new formulation is proposed for the problem. The validity and the effectiveness of the proposed formulation is evaluated by some test problems and compared with previous formulations as well.
