On-line service scheduling
From MaRDI portal
Publication:835637
DOI10.1007/S10951-008-0075-7zbMATH Open1168.90476OpenAlexW2168963756MaRDI QIDQ835637FDOQ835637
Authors: Bo Chen, Zhenbo Wang, Wenxun Xing 
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0075-7
Recommendations
Cites Work
- Scheduling Parallel Machines On-Line
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Title not available (Why is that?)
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Algorithms for Scheduling Tasks on Unrelated Processors
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Worst-case analysis for on-line service policies
Cited In (9)
- Makespan minimization in online scheduling with machine eligibility
- Competitive on-line scheduling with level of service
- On-line scheduling with setup costs
- Title not available (Why is that?)
- Worst-case analysis for on-line service policies
- Online facility assignment
- Makespan minimization in online scheduling with machine eligibility
- Performance of service policies in a specialized service system with parallel servers
- Online service with delay on a line
This page was built for publication: On-line service scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835637)
