Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
From MaRDI portal
Publication:6077487
Recommendations
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- 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
Cites work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A note on a two-agent scheduling problem related to the total weighted late work
- A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- A two-agent single-machine scheduling problem with late work criteria
- Algorithms for Scheduling Independent Tasks
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Approximation algorithms for scheduling a single machine to minimize total late work
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Complexity of single machine hierarchical scheduling: A survey
- Complexity of two dual criteria scheduling problems
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (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
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- Multiagent scheduling. Models and algorithms
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On an extension of the Sort \& Search method with application to scheduling theory
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Pareto-scheduling of two competing agents with their own equal processing times
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Reducibility among combinatorial problems
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Scheduling Problems with Two Competing Agents
- Scheduling to tradeoff between the number and the length of accepted jobs
- Scheduling with competing agents, total late work and job rejection
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Single machine scheduling with two competing agents and equal job processing times
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Single-machine scheduling with deadlines to minimize the total weighted late work
- Single-machine scheduling with multi-agents to minimize total weighted late work
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(11)- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Scheduling a single machine with primary and secondary objectives
- 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
- Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs
- The single-machine preemptive or resumable scheduling with maintenance intervals
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
- Single machine scheduling with the total weighted late work and rejection cost
This page was built for publication: Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077487)
