An on-line LS algorithm for some Q_m|r_j|C_ scheduling

MaRDI QIDQ2780944zbMATH OpenFDO

Authors Xingtao Cao, Guijuan Chang, Yuzhong Zhang

Publication date 10 April 2002

Published in Journal of Qufu Normal University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

makespanuniform machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:4489417
• An optimal algorithm for preemptive on-line scheduling
• Approximating the optimal algorithm for online scheduling problems via dynamic programming
• Optimal on-line algorithms for single-machine scheduling
• A class of on-line scheduling algorithms to minimize total completion time
• On-line scheduling algorithms for a batch machine with finite capacity
• New lower and upper bounds for on-line scheduling
• Randomized online algorithms for maximizing busy time interval scheduling
• A better lower bound for on-line scheduling
• A lower bound for randomized on-line scheduling algorithms

Cited in

(2)

• scientific article; zbMATH DE number 1474842 (Why is no real title available?)
• scientific article; zbMATH DE number 1559110 (Why is no real title available?)

This page was built for publication: An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling

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