Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
From MaRDI portal
(Redirected from Publication:2083387)
Recommendations
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single-machine scheduling with multi-agents to minimize 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
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
Cites work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A note on a two-agent scheduling problem related to the total weighted late work
- A two-agent single-machine scheduling problem with late work criteria
- Approximation algorithms for scheduling a single machine to minimize total late work
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the number of tardy job units under release time constraints
- Minimizing the weighted number of tardy task units
- Minimizing total late work on a single machine with generalized due-dates
- On Finding the Maxima of a Set of Vectors
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Scheduling with competing agents, total late work and job rejection
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single-machine scheduling to minimize total weighted late work with positional due-indices
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Single-machine scheduling with maintenance activities and rejection
- Single-machine scheduling with multi-agents to minimize total weighted late work
- The complexity of two supply chain scheduling problems
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Two competitive agents to minimize the weighted total late work and the total completion time
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(7)- Single-machine scheduling with multi-agents to minimize total weighted late work
- Pareto optima for total weighted completion time and maximum lateness on a single machine
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine 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
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- Single machine scheduling with the total weighted late work and rejection cost
This page was built for publication: Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2083387)
