Pages that link to "Item:Q5704194"
From MaRDI portal
The following pages link to Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time (Q5704194):
Displaying 40 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← 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)
- Online over time processing of combinatorial problems (Q1617394) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
- The medical laboratory scheduling for weighted flow-time (Q1740398) (← 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)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
- Online scheduling of jobs with kind release times and deadlines on a single machine (Q2422652) (← links)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME (Q2920365) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← 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)
- LPT online strategy for parallel-machine scheduling with kind release times (Q5963697) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling (Q6086005) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)