Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

DOI10.1007/978-981-16-1877-2_4MaRDI QIDQ1980488zbMATH OpenOpenAlexFDO

Authors Man Xiao, Lu Ding, Shu Zhao, Weidong Li

Publication date 8 September 2021

Full work available at URL https://doi.org/10.1007/978-981-16-1877-2_4

zbMATH Keywords

competitive ratiobuffersemi-online algorithmhierarchical machines

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Optimal online algorithms for hierarchical scheduling on three parallel machines
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Online parallel machines scheduling with two hierarchies
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements

Cites work

• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• Online and semi-online scheduling of two machines under a grade of service provision
• Online minimum makespan scheduling with a buffer
• Online parallel machines scheduling with two hierarchies
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• Parallel machine scheduling under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
• The Power of Reordering for Online Minimum Makespan Scheduling
• Two approximation schemes for scheduling on parallel machines under a grade of service provision

Cited in

(11)

• Approximation scheme for single-machine rescheduling with job delay and rejection
• Preemptive online algorithms for scheduling on three machines with hierarchies
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Algorithms for hierarchical and semi-partitioned parallel scheduling
• Online early work maximization on three hierarchical machines with a common due date
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
• Optimal online algorithms for hierarchical scheduling on three parallel machines
• Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements

This page was built for publication: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

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