scientific article; zbMATH DE number 1420452

zbMATH Open0951.68517MaRDI QIDQ4944729FDOQ4944729

Authors: Zhuxi Liu, Qifan Yang 

Publication date: 7 June 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

schedulingtardiness

Mathematics Subject Classification ID

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

Cited In (6)

• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• Polynomial algorithms for single machine scheduling problems with financial constraints
• A polynomial algorithm for a one machine batching problem
• Title not available (Why is that?)
• A polynomial algorithm for an integer quadratic non-separable transportation problem
• Title not available (Why is that?)

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)