The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs

DOI10.1007/978-3-319-39817-4_24zbMath1475.90026OpenAlexW2498006381MaRDI QIDQ4632193

Hongluan Zhao, Gongwen Xu, Guoyong Han

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_24

zbMATH Keywords

batchdue windowearlinesstardinessnon-identical size

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unbounded batch scheduling with a common due window on a single machine
• Efficient scheduling algorithms for a single batch processing machine
• Determination of common due window location in a single machine scheduling problem
• Scheduling with agreeable release times and due dates on a batch processing machine
• Makespan minimization on single batch-processing machine via ant colony optimization
• A PTAS for semiconductor burn-in scheduling
• Common due window size and location determination in a single machine scheduling problem
• Scheduling a single batch processing machine with non-identical job sizes

This page was built for publication: The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs