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

zbMATH Open1174.90457MaRDI QIDQ5456087FDOQ5456087

Authors: Sheng-Yi Cai 

Publication date: 4 April 2008

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

zbMATH Keywords

optimal algorithmworst-case ratioparallel machine scheduling problem

Mathematics Subject Classification ID

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

Cited In (7)

• Machine covering with combined partial information
• SEMI-ONLINE MACHINE COVERING
• Optimal semi-online algorithms for machine covering
• Title not available (Why is that?)
• Approximation and Online Algorithms
• Semi-online machine covering for two uniform machines
• Optimal semi-online algorithm for machine covering with nonsimultaneous machine available times

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)