Online, semi-online algorithms for machine covering with non-simultaneous machine available time

MaRDI QIDQ5456087zbMATHFDO

Authors Sheng-Yi Cai

Publication date 4 April 2008

zbMATH Keywords

optimal algorithmworst-case ratioparallel machine scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Optimal semi-online algorithm for machine covering with nonsimultaneous machine available times
• scientific article; zbMATH DE number 5583893
• scientific article; zbMATH DE number 1932350
• SEMI-ONLINE MACHINE COVERING
• Optimal semi-online algorithms for machine covering

Cited in

(7)

• Approximation and Online Algorithms
• Semi-online machine covering for two uniform machines
• SEMI-ONLINE MACHINE COVERING
• Optimal semi-online algorithms for machine covering
• Machine covering with combined partial information
• Optimal semi-online algorithm for machine covering with nonsimultaneous machine available times
• scientific article; zbMATH DE number 1932350 (Why is no real title available?)

This page was built for publication: Online, semi-online algorithms for machine covering with non-simultaneous machine available time

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