Study for batch scheduling on single machine

MaRDI QIDQ4574474zbMATH OpenFDO

Authors Yujie Yan

Publication date 18 July 2018

zbMATH Keywords

approximation algorithmbatch schedulingcombinatorial optimizationcomputational complexity

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1559487
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• scientific article; zbMATH DE number 1629977
• scientific article; zbMATH DE number 1256760
• Approximation schemes for scheduling a batching machine with nonidentical job size

Cited in

(2)

• Approximation algorithms for scheduling a single machine to minimize total late work
• scientific article; zbMATH DE number 1559487 (Why is no real title available?)

This page was built for publication: Study for batch scheduling on single machine

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