Approximation algorithm for parallel-batch scheduling with resource matching and rejection

DOI10.1007/S10878-026-01467-8MaRDI QIDQ7406203zbMATH OpenFDO

Authors Wenhua Li, Liang Zhang, R. Lin, Shisheng Li

Publication date 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01467-8

zbMATH Keywords

approximation algorithmjob sizeparallel-batch schedulingrejection costresource matching

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• A survey on job scheduling with rejection
• A survey on offline scheduling with rejection
• An improved heuristic for parallel machine scheduling with rejection
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Benders decompositions for order acceptance and scheduling in additive manufacturing
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Combinatorial optimization. Theory and algorithms
• Faster algorithms for single machine scheduling with release dates and rejection
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Improved bounds for batch scheduling with nonidentical job sizes
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
• Multiprocessor Scheduling with Rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• Parallel-machine scheduling with release dates and rejection
• Scheduling dedicated jobs with variative processing times
• Scheduling on parallel-batch machines with rejection and resource matching
• Scheduling with release times and rejection on two parallel machines
• Single machine scheduling with release dates and rejection
• Socially fair matching: exact and approximation algorithms
• The partitioning min-max weighted matching problem

This page was built for publication: Approximation algorithm for parallel-batch scheduling with resource matching and rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7406203)