Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness

DOI10.1007/978-3-540-73814-5_16MaRDI QIDQ3612587zbMATH OpenOpenAlexFDO

Authors Shuyan Bai, Fuzeng Zhang, Shu-Guang Li, Qiming 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)

Recommendations

• Computing and Combinatorics
• Scheduling jobs with release dates on parallel batch processing machines
• On scheduling an unbounded batch machine
• Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
• scientific article; zbMATH DE number 2080976

Cited in

(12)

• Inverse scheduling with maximum lateness objective
• Batch scheduling on uniform machines to minimize total flow-time
• On scheduling an unbounded batch machine
• Busy time scheduling on a bounded number of machines (extended abstract)
• A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
• Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
• Computing and Combinatorics
• scientific article; zbMATH DE number 7070855 (Why is no real title available?)
• Scheduling an unbounded batching machine with job processing time compatibilities
• Delay-bounded scheduling without delay!

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

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