Pages that link to "Item:Q4294731"
From MaRDI portal
The following pages link to A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work (Q4294731):
Displaying 35 items.
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
- Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
- Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays (Q1631999) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917) (← links)
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem (Q4950821) (← links)
- Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
- A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913) (← links)
- Single‐machine scheduling with deadlines to minimize the total weighted late work (Q5241424) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
- Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)
