Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time

DOI10.1007/S10878-023-01086-7MaRDI QIDQ6084675zbMATH OpenOpenAlexFDO

Authors Man Xiao, Xiaoqiao Liu, Weidong Li

Publication date 6 November 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-023-01086-7

zbMATH Keywords

competitive ratioearly workhierarchysemi-onlineuniform machines

Mathematics Subject Classification ID

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

Recommendations

• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements
• Online early work maximization on three hierarchical machines with a common due date
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Optimal algorithms for semi-online machine covering on two hierarchical machines

Cites work

• A note on hierarchical scheduling on two uniform machines
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• Online and semi-online scheduling of two machines under a grade of service provision
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements
• Online scheduling on parallel machines: a survey
• Randomized on-line scheduling on two uniform machines
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Semi on-line algorithms for the partition problem
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• Semi-online scheduling problems on two uniform machines under a grade of service provision
• Semi-online scheduling: a survey
• Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
• Two semi-online scheduling problems on two uniform machines
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

Cited in

(5)

• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Online early work maximization on three hierarchical machines with a common due date
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements
• Online budget allocation maximization problem on two uniform machines with a common due date
• Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

This page was built for publication: Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time

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