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

DOI10.1016/J.TCS.2013.11.026MaRDI QIDQ389944zbMATHOpenAlexFDO

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

zbMATH Keywords

online schedulinglookaheadbuffergrade of serviceunit processing time

Mathematics Subject Classification ID

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

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

Cites work

• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• New algorithms for online rectangle filling with \(k\)-lookahead
• On the second largest Laplacian eigenvalues of trees with nearly perfect matchings
• On-line load balancing in a hierarchical server topology
• 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
• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Online scheduling on parallel machines with two goS levels
• Online scheduling on two uniform machines to minimize the makespan
• Parallel machine scheduling under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• Semi on-line algorithms for the partition problem
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Semi-online scheduling problems on two uniform machines under a grade of service provision

Cited in

(6)

• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Optimal algorithm for semi-online scheduling on two machines under GoS levels
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• Semi-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 Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing

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)