Single Machine Scheduling to Minimize Total Weighted Late Work
From MaRDI portal
Publication:4896450
Recommendations
- Single Machine Scheduling to Minimize Total Late Work
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Approximation algorithms for scheduling a single machine to minimize total late work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
Cited in
(36)- A note on a two-agent scheduling problem related to the total weighted late work
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Single-machine scheduling to minimize total weighted late work with positional due-indices
- Pareto-scheduling of two competing agents with their own equal processing times
- Single machine scheduling problem with minimize total weighted early work
- A new perspective on single-machine scheduling problems with late work related criteria
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- A parallel machine scheduling problem maximizing total weighted early work
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Minimizing total late work on a single machine with generalized due-dates
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Two competitive agents to minimize the weighted total late work and the total completion time
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A survey of due-date related single-machine with two-agent scheduling problem
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Approximation algorithms for scheduling a single machine to minimize total late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- On the approximability of the two-phase knapsack problem
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Single Machine Scheduling to Minimize Total Late Work
- Minimizing total weighted late work on a single-machine with non-availability intervals
This page was built for publication: Single Machine Scheduling to Minimize Total Weighted Late Work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896450)
