Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
DOI10.1002/NAV.21961zbMATH Open1523.90226OpenAlexW3100829966MaRDI QIDQ6076476FDOQ6076476
Authors: Yuan Zhang, Jinjiang Yuan, Chi To Ng, T. C. Edwin Cheng 
Publication date: 17 October 2023
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21961
Recommendations
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
schedulingtotal weighted completion timeweighted number of tardy jobstotal weighted late workthree-agent Pareto-optimization
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- A multiple-criterion model for machine scheduling
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling Problems with Two Competing Agents
- Multiagent scheduling. Models and algorithms
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Two-agent single-machine scheduling problem with just-in-time jobs
- Title not available (Why is that?)
- A scheduling problem with three competing agents
- Title not available (Why is that?)
- Single Machine Scheduling to Minimize 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
- A note on a two-agent scheduling problem related to the total weighted late work
- Two-agent single-machine scheduling with cumulative deterioration
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- \(CON/SLK\) due date assignment and scheduling on a single machine with two agents
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Complexities of four problems on two-agent scheduling
- 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
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Price of fairness in two-agent single-machine scheduling problems
- Complexities of some problems on multi-agent scheduling on a single machine
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- A just-in-time scheduling problem with two competing agents
Cited In (9)
- 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
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- A note on Pareto minimizing total completion time and maximum cost
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Single-machine scheduling with multi-agents to minimize total weighted late work
This page was built for publication: Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, 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 Q6076476)
