Abstract: We consider a single machine scheduling problem involving both the processing and scheduling of job delivery. A common due date for the jobs and job delivery time need to be determined in order to minimize the sum of the penalties (i.e., earliness penalties, tardiness penalties and delivery costs etc). Finished jobs are delivered in batches and all the jobs completed before or at the due date are delivered in a batch at the optimal due date. There is no capacity limitation on a batch delivery. The optimal common due date is determined and the optimal sequencing is presented.