Recommendations
Cites work
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- Algorithms for Scheduling Tasks on Unrelated Processors
- Bounds for Certain Multiprocessing Anomalies
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Scheduling Parallel Machines On-Line
- The Competitiveness of On-Line Assignments
- Worst-case analysis for on-line service policies
Cited in
(9)- Online facility assignment
- Makespan minimization in online scheduling with machine eligibility
- scientific article; zbMATH DE number 2221462 (Why is no real title available?)
- Performance of service policies in a specialized service system with parallel servers
- Online service with delay on a line
- Makespan minimization in online scheduling with machine eligibility
- Competitive on-line scheduling with level of service
- On-line scheduling with setup costs
- Worst-case analysis for on-line service policies
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)
