Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
From MaRDI portal
Publication:668562
DOI10.1016/j.amc.2015.10.059zbMath1410.90096OpenAlexW2174847907MaRDI QIDQ668562
Lijun Wei, Long Wan, Jinjiang Yuan
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
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)
Related Items
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, 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, Competitive two-agent scheduling with release dates and preemption on a single machine, A note on competing-agent Pareto-scheduling, 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
Cites Work
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A note on the scheduling with two families of jobs
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Solving a bicriterion scheduling problem
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multicriteria scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Two-Agent Scheduling on an Unbounded Serial Batching Machine
- Scheduling Problems with Two Competing Agents
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
