A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
From MaRDI portal
(Redirected from Publication:763490)
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''
Recommendations
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- An alternative proof of an optimal online algorithm for single-machine scheduling with deteriorating jobs
- Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Cites work
Cited in
(6)- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
This page was built for publication: A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763490)