Worst-case analysis for on-line service policies
From MaRDI portal
Publication:2268767
DOI10.1007/s10878-008-9170-0zbMath1185.90101MaRDI QIDQ2268767
Publication date: 9 March 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9170-0
90B35: Deterministic scheduling theory in operations research
90B22: Queues and service in operations research
Related Items
Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, On-line service scheduling, Allocation and optimization of shared self-service check-in system based on integer programming model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Performance of service policies in a specialized service system with parallel servers
- Online scheduling on parallel machines with two goS levels
- Parallel machine scheduling under a grade of service provision
- New lower and upper bounds for on-line scheduling
- Algorithms for Scheduling Independent Tasks
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- `` Strong NP-Completeness Results
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Parallel machine scheduling with special jobs
- Bounds for Certain Multiprocessing Anomalies