The following pages link to (Q4368485):
Displaying 33 items.
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost (Q2059092) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- Online Single Machine Scheduling to Minimize the Maximum Starting Time (Q4595323) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE (Q5076084) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- LPT online strategy for parallel-machine scheduling with kind release times (Q5963697) (← links)
