Pages that link to "Item:Q960514"
From MaRDI portal
The following pages link to New algorithms for an ancient scheduling problem. (Q960514):
Displaying 50 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- List's worst-average-case or WAC ratio (Q835596) (← links)
- Scheduling resource allocation with timeslot penalty for changeover (Q861274) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- Scheduling uniform machines on-line requires nondecreasing speed ratios (Q1290644) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Randomized on-line scheduling on three processors. (Q1417594) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- A manifesto for the computational method (Q1603721) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- (Q5009506) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- On two dimensional packing (Q5054823) (← links)
