Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
DOI10.1016/J.AMC.2015.10.059zbMATH Open1410.90096OpenAlexW2174847907MaRDI QIDQ668562FDOQ668562
Authors: Long Wan, Jinjiang Yuan, Lijun Wei 
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.10.059
Recommendations
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- A note on competing-agent Pareto-scheduling
- scientific article; zbMATH DE number 7109369
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Competitive two-agent scheduling and its applications
- Two-agent scheduling on an unbounded serial batching machine
- Scheduling Problems with Two Competing Agents
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A note on the scheduling with two families of jobs
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Multicriteria scheduling
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Solving a bicriterion scheduling problem
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
Cited In (11)
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- A note on competing-agent Pareto-scheduling
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Pareto-scheduling of two competing agents with their own equal processing times
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- A note on Pareto minimizing total completion time and maximum cost
- Pareto minimizing total completion time and maximum cost with positional due indices
- Competitive two-agent scheduling with release dates and preemption on a single machine
This page was built for publication: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668562)
