Approximation algorithms for batch scheduling with processing set restrictions

DOI10.1007/S10951-022-00720-2MaRDI QIDQ6124768zbMATH OpenOpenAlexFDO

Authors Xing Chai, Wenhua Li, Chi To Ng, T. C. Edwin Cheng

Publication date 2 April 2024

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-022-00720-2

zbMATH Keywords

batchmakespanprocessing set restrictionsschedulinguniform machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel batch scheduling with nested processing set restrictions
• Fast approximation algorithms for job scheduling with processing set restrictions
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• scientific article; zbMATH DE number 1629977
• scientific article; zbMATH DE number 2080262

Cites work

• Fast approximation algorithms for uniform machine scheduling with processing set restrictions
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line scheduling algorithms for a batch machine with finite capacity
• Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• Parallel batch scheduling with nested processing set restrictions
• Scheduling a batching machine

Cited in

(2)

• Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities
• Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions

This page was built for publication: Approximation algorithms for batch scheduling with processing set restrictions

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