The following pages link to Computing and Combinatorics (Q4681179):
Displaying 13 items.
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220) (← links)
- Improved on-line broadcast scheduling with deadlines (Q835602) (← links)
- Competitive analysis of most-request-first for scheduling broadcasts with start-up delay (Q924150) (← links)
- A near optimal scheduler for on-demand data broadcasts (Q935145) (← links)
- A note on on-line broadcast scheduling with deadlines (Q976075) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- A tight lower bound for job scheduling with cancellation (Q1044744) (← links)
- Prompt mechanism for online auctions with multi-unit demands (Q2355988) (← links)
- Design and analysis of online batching systems (Q2379918) (← links)
- On-line production order scheduling with preemption penalties (Q2385487) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Prompt Mechanism for Online Auctions with Multi-unit Demands (Q2867113) (← links)
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs (Q3007646) (← links)
