Approximation algorithms for batch scheduling with processing set restrictions

DOI10.1007/S10951-022-00720-2OpenAlexW4220940462MaRDI QIDQ6124768

Cheng, T. C. Edwin, C. T. Daniel Ng, Wenhua Li, Xing Chai

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

batchschedulingmakespanuniform machinesprocessing set restrictions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm
• Scheduling a batching machine
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• Fast approximation algorithms for uniform machine scheduling with processing set restrictions
• On-line scheduling algorithms for a batch machine with finite capacity
• Parallel batch scheduling with nested processing set restrictions
• Minimizing makespan on a single batch processing machine with dynamic job arrivals

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