Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
From MaRDI portal
Publication:1980488
DOI10.1007/978-981-16-1877-2_4zbMATH Open1481.68049OpenAlexW3153485508MaRDI QIDQ1980488FDOQ1980488
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
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Parallel machine scheduling under a grade of service provision
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Online minimum makespan scheduling with a buffer
- Scheduling parallel machines with inclusive processing set restrictions
- The Power of Reordering for Online Minimum Makespan Scheduling
- Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
Cited In (11)
- Online early work maximization on three hierarchical machines with a common due date
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Approximation scheme for single-machine rescheduling with job delay and rejection
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
- Optimal online algorithms for hierarchical scheduling on three parallel machines
- Preemptive online algorithms for scheduling on three machines with hierarchies
- 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)
