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.21961zbMath1523.90226OpenAlexW3100829966MaRDI QIDQ6076476

C. T. Daniel Ng, Yuan Zhang, Jinjiang Yuan, Cheng, T. C. Edwin

Publication date: 17 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21961

zbMATH Keywords

schedulingtotal weighted completion timeweighted number of tardy jobstotal weighted late workthree-agent Pareto-optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Pareto-scheduling of two competing agents with their own equal processing times ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the 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 preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A scheduling problem with three competing agents
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
• Complexities of four problems on two-agent scheduling
• Price of fairness in two-agent single-machine scheduling problems
• Two-agent single-machine scheduling with cumulative deterioration
• Complexities of some problems on multi-agent scheduling on a single machine
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Single-machine scheduling with multi-agents to minimize total weighted late work
• A just-in-time scheduling problem with two competing agents
• Two-agent single-machine scheduling problem with just-in-time jobs
• 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
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• 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
• A note on a two-agent scheduling problem related to the total weighted late work
• A multiple-criterion model for machine scheduling
• Scheduling Problems with Two Competing Agents
• Single Machine Scheduling to Minimize Total Late Work
• Algorithms for Scheduling Independent Tasks
• CON/SLK due date assignment and scheduling on a single machine with two agents
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Multiagent Scheduling
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

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