Pages that link to "Item:Q1196210"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210):
Displaying 35 items.
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
- Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← 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)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← 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)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← 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 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)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- Single Machine Scheduling to Minimize Total Late Work (Q4017089) (← links)
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work (Q4294731) (← links)
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917) (← links)
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- Algorithms and Data Structures (Q5900744) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← 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)
