A fast algorithm for single processor scheduling
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
A fast algorithm for multiprocessor scheduling
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Scheduling a capacitated batch-processing machine to minimize makespan
Robotics and Computer-Integrated Manufacturing
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
Theoretical Computer Science
Computers and Operations Research
Bicriterion scheduling with equal processing times on a batch processing machine
Computers and Operations Research
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing
Robotics and Computer-Integrated Manufacturing
Scheduling jobs with release dates on parallel batch processing machines
Discrete Applied Mathematics
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
Theoretical Computer Science
Scheduling with families of jobs and delivery coordination under job availability
Theoretical Computer Science
Unbounded parallel-batch scheduling with family jobs and delivery coordination
Information Processing Letters
Makespan minimization on single batch-processing machine via ant colony optimization
Computers and Operations Research
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
Mathematical and Computer Modelling: An International Journal
Minimizing total completion time on a batch processing machine with job families
Operations Research Letters
A two stage scheduling with transportation and batching
Information Processing Letters
Tabu search and lower bounds for a combined production-transportation problem
Computers and Operations Research
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Optimal batch schedules for parallel machines
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Scheduling unrelated parallel batch processing machines with non-identical job sizes
Computers and Operations Research
| Hi-index | 0.00 |
Scheduling problems of a batch processing machine are solved by efficient algorithms. On a batch processing machine, multiple jobs can be processed simultaneously in a batch form. We call the number of jobs in the batch the batch size, which can be any integer between 1 and k, a predetermined integer of the maximum batch size. The process time of a batch is constant and independent of the batch size. Preemption is not allowed. Given n jobs with release times r"1 and due dates d"i, i = 1...., n, we give efficient algorithms to find a feasible schedule, if any, which minimizes the final completion time under the assumption such that for r"i r"j, d"i = d"j. Some industrial applications are discussed.