Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines

2017/08/21 by Shuguang Li, Li, Shuguang
Engineering · #68M20 #90B35 #Advanced Manufacturing and Logistics Optimization #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Packing Problems #Scheduling and Optimization Algorithms

paper · pdf · doi:10.48550/arxiv.1708.06048

openalex publication_date 2017/08/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algorithms for minimizing makespan.

Related

• A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
• A Note on Scheduling Equal-Length Jobs to Maximize Throughput
• Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
• Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost