Online algorithms for scheduling with machine activation cost on two uniform machines
From MaRDI portal
(Redirected from Publication:886402)
Recommendations
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost
- New upper and lower bounds for online scheduling with machine cost
- Online scheduling with general machine cost functions
- Online scheduling of two uniform machines to minimize total completion times
Cites work
- scientific article; zbMATH DE number 1418274 (Why is no real title available?)
- A lower bound for on-line scheduling on uniformly related machines
- An optimal online algorithm for scheduling two machines with release times
- Better Online Algorithms for Scheduling with Machine Cost
- Bounds for List Schedules on Uniform Processors
- Flowshop scheduling with identical jobs and uniform parallel machines
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
- On-line load balancing for related machines
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Preemptive online algorithms for scheduling with machine cost
- Randomized on-line scheduling on two uniform machines
Cited in
(6)- Generalized machine activation problems
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- Online scheduling with machine cost and a quadratic objective function
- Scheduling games on uniform machines with activation cost
This page was built for publication: Online algorithms for scheduling with machine activation cost on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q886402)