We study the unbounded parallel-batch scheduling problem with the jobs having agreeable release dates and processing times to minimize the total weighted number of tardy jobs. In this problem, we consider two types of jobs: batch jobs and drop-line jobs. For batch jobs, the completion time of a job is given by the completion time of the batch containing this job. For drop-line jobs, the completion time of a job is given by the starting time of the batch containing this job plus the processing time of this job. For both of batch jobs and drop-line jobs, we show that (1) the problems are binary NP-hard, (2) the problems are solvable in pseudo-polynomial times, and when the number of weights is a constant, the problems are solvable in polynomial times, and (3) the problems have a fully polynomial-time approximation scheme.
Parallel-batch scheduling Release dates Drop-line jobs Polynomial-time approximation scheme
This is a preview of subscription content, log in to check access.
The authors would like to thank the associate editor and two anonymous referees for their constructive comments and helpful suggestions. This research was supported by NSFC (11671368, 11771406, 11571323).
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscozbMATHGoogle Scholar
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326MathSciNetCrossRefzbMATHGoogle Scholar
Lee CY, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37:219–236CrossRefzbMATHGoogle Scholar
Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29:990–1001CrossRefGoogle Scholar
Tian J, Wang Q, Fu RY, Yuan JJ (2016) Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor Comput Sci 617:65–68MathSciNetCrossRefzbMATHGoogle Scholar
Wei ZG (2011) Scheduling on a batch machine with item-availability to minimize total weighted completion time. Master Degree Thesis, Zhengzhou UniversityGoogle Scholar