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_4zbMath1481.68049OpenAlexW3153485508MaRDI QIDQ1980488
Lu Ding, Weidong Li, Man Xiao, Shu Zhao
Publication date: 8 September 2021
Full work available at URL: https://doi.org/10.1007/978-981-16-1877-2_4
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Online early work maximization on three hierarchical machines with a common due date ⋮ Approximation scheme for single-machine rescheduling with job delay and rejection ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements
Cites Work
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- 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
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online Minimum Makespan Scheduling with a Buffer
- 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
- Scheduling parallel machines with inclusive processing set restrictions
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
This page was built for publication: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
