scientific article; zbMATH DE number 1420452

MaRDI QIDQ4944729zbMATH OpenFDO

Authors Zhuxi Liu, Qifan Yang

Publication date 7 June 2000

zbMATH Keywords

schedulingtardiness

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On minimizing total tardiness in a serial batching problem
• A polynomial algorithm for a one machine batching problem
• scientific article; zbMATH DE number 1792073
• On minimizing the sum of k tardinesses
• scientific article; zbMATH DE number 1559487

Cited in

(6)

• A polynomial algorithm for a one machine batching problem
• A polynomial algorithm for an integer quadratic non-separable transportation problem
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• scientific article; zbMATH DE number 67596 (Why is no real title available?)
• scientific article; zbMATH DE number 781227 (Why is no real title available?)

This page was built for publication:

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