Greedy multiprocessor server scheduling
From MaRDI portal
Publication:2466596
DOI10.1016/J.ORL.2005.07.005zbMATH Open1133.90334OpenAlexW2088632781MaRDI QIDQ2466596FDOQ2466596
Authors: Carl Bussema, Eric Torng 
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.005
Recommendations
- scientific article; zbMATH DE number 67289
- Multiprocessor scheduling by generalized extremal optimization
- Multiple server preemptive scheduling with impatience
- A scheduling problem for several parallel servers
- On multiprocessor system scheduling
- scientific article; zbMATH DE number 4072695
- scientific article; zbMATH DE number 3970495
- Shared multi-processor scheduling
- Task allocation in a multi-server system
- Multiprocessor scheduling with machine allotment and parallelism constraints
Cites Work
- Title not available (Why is that?)
- Online Scheduling to Minimize Average Stretch
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal time-critical scheduling via resource augmentation
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Server scheduling in the L p norm
- LATIN 2004: Theoretical Informatics
- Minimizing the flow time without migration
- Algorithms for minimizing weighted flow time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Greedy multiprocessor server scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466596)
