Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
From MaRDI portal
Publication:4958564
deterministic schedulingonline algorithmrelease timestotal weighted completion timeunrelated machines
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Stochastic scheduling theory in operations research (90B36) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Stochastic online scheduling on unrelated machines
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
Cites work
Cited in
(5)- Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
- Erratum to: ``A survey on offline scheduling with rejection
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Sequencing stochastic jobs with a single sample
This page was built for publication: Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958564)