scientific article; zbMATH DE number 1559110

MaRDI QIDQ4528357zbMATH OpenFDO

Authors Yong He

Publication date 31 January 2001

zbMATH Keywords

approximation algorithmsmultifit schedulinguniform machine schedulingworst case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
• A heuristic algorithm of the \(Q//C_{\max}\) problem on multi-tasks with uniform processors
• A linear compound algorithm for uniform machine scheduling
• An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling
• Publication:4489417

Cited in

(3)

• scientific article; zbMATH DE number 3864974 (Why is no real title available?)
• scientific article; zbMATH DE number 3904310 (Why is no real title available?)
• A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem

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 Q4528357)