Pages that link to "Item:Q1961232"
From MaRDI portal
The following pages link to Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232):
Displaying 40 items.
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
- Minimum equivalent precedence relation systems (Q2410264) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- On the approximability of single-machine scheduling with precedence constraints (Q2884295) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling (Q3169127) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints (Q3402964) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem (Q3637403) (← links)
- Min-Sum Scheduling Under Precedence Constraints (Q4606348) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
- Integer Programming and Combinatorial Optimization (Q5712462) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)
