Parallel-batch scheduling with rejection: structural properties and approximation algorithms

DOI10.1016/J.EJOR.2023.04.019MaRDI QIDQ6113447zbMATH OpenFDO

Authors Jinwen Ou, Lingfa Lu, Xueling Zhong

Publication date 11 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.04.019

zbMATH Keywords

approximation algorithmparallel-batchrejectionschedulingworst-case analysis

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• A survey of scheduling with parallel batch (p-batch) processing
• A survey on offline scheduling with rejection
• Approximation algorithms in batch processing
• Bicriteria order acceptance and scheduling with consideration of fill rate
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Coordinated scheduling of the outsourcing, in-house production and distribution operations
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Faster algorithms for single machine scheduling with release dates and rejection
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Minimizing makespan in batch machine scheduling
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• Mixed batch scheduling on identical machines
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• On scheduling an unbounded batch machine
• On the parameterized tractability of single machine scheduling with rejection
• Scheduling a batching machine
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
• Scheduling Groups of Jobs on a Single Machine
• Scheduling one batch processor subject to job release dates
• Scheduling parallel machines with inclusive processing set restrictions and job rejection
• Scheduling with batching: A review
• Single machine scheduling with release dates and rejection
• Single-machine scheduling under the job rejection constraint
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Cited in

(9)

• Erratum to: ``A survey on offline scheduling with rejection
• Approximation algorithms for parallel batch machine scheduling of malleable jobs
• An efficient heuristic for a real-life OAS problem
• Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities
• Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
• Scheduling on parallel-batch machines with rejection and resource matching
• Submodular batch scheduling on parallel machines
• Integrating dynamic revenue management with project management
• Single-machine and flow-shop scheduling with supporting tasks in a nested structure

This page was built for publication: Parallel-batch scheduling with rejection: structural properties and approximation algorithms

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