Online algorithms for scheduling with machine activation cost on two uniform machines
From MaRDI portal
Publication:886402
DOI10.1631/JZUS.2007.A0127zbMATH Open1119.68315MaRDI QIDQ886402FDOQ886402
Juejiang Hu, Shuguang Han, Yiwei Jiang
Publication date: 27 June 2007
Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)
Cites Work
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Bounds for List Schedules on Uniform Processors
- Better Online Algorithms for Scheduling with Machine Cost
- Title not available (Why is that?)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Randomized on-line scheduling on two uniform machines
- An optimal online algorithm for scheduling two machines with release times
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Preemptive online algorithms for scheduling with machine cost
- A lower bound for on-line scheduling on uniformly related machines
- Flowshop scheduling with identical jobs and uniform parallel machines
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
- On-line load balancing for related machines
Cited In (3)
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 π π
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)