Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness

DOI10.1007/978-3-540-73814-5_16zbMath1214.90048OpenAlexW1789061889MaRDI QIDQ3612587

Shuyan Bai, Fuzeng Zhang, Shuguang Li, Qi-Ming Liu

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73814-5_16

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

This page was built for publication: Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness