Semi-online scheduling with two GoS levels and unit processing time

DOI10.1016/j.tcs.2013.11.026zbMath1310.68254OpenAlexW2092108977MaRDI QIDQ389944

Taibo Luo, Li Luo, Changzheng He, Yin-Feng 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

zbMATH Keywords

buffergrade of serviceonline schedulinglookaheadunit processing time

Mathematics Subject Classification ID

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

Related Items (5)

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements ⋮ Semi-online hierarchical load balancing problem 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

Cites Work

• Unnamed Item
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• 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
• New algorithms for online rectangle filling with \(k\)-lookahead
• 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
• Online scheduling on two uniform machines to minimize the makespan
• Semi on-line algorithms for the partition problem
• 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
• Parallel machine scheduling under a grade of service provision
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• On-Line Load Balancing in a Hierarchical Server Topology
• Online Minimum Makespan Scheduling with a Buffer
• Scheduling parallel machines with inclusive processing set restrictions

This page was built for publication: Semi-online scheduling with two GoS levels and unit processing time