Semi-online scheduling with two GoS levels and unit processing time
From MaRDI portal
Publication:389944
DOI10.1016/J.TCS.2013.11.026zbMATH Open1310.68254OpenAlexW2092108977MaRDI QIDQ389944FDOQ389944
Authors: Taibo Luo, Li Luo, Changzheng He, Yinfeng Xu 
Publication date: 22 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.026
Recommendations
- Online and semi-online scheduling of two machines under a grade of service provision
- Online Scheduling on Parallel Machines with Two GoS Levels
- Online scheduling on parallel machines with two goS levels
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
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
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- On-line load balancing in a hierarchical server topology
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- Semi on-line algorithms for the partition problem
- Parallel machine scheduling under a grade of service provision
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Online scheduling on two uniform machines to minimize the makespan
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Online minimum makespan scheduling with a buffer
- Scheduling parallel machines with inclusive processing set restrictions
- On the second largest Laplacian eigenvalues of trees with nearly perfect matchings
- New algorithms for online rectangle filling with \(k\)-lookahead
Cited In (6)
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
- Semi-online hierarchical load balancing problem with bounded processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
This page was built for publication: Semi-online scheduling with two GoS levels and unit processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389944)
