Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work

DOI10.1002/nav.22050zbMath1523.90159OpenAlexW4213345466MaRDI QIDQ6077487

Cheng, T. C. Edwin, Shuen Guo, Jinjiang Yuan, Ling-Fa Lu, C. T. Daniel Ng

Publication date: 18 October 2023

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

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

zbMATH Keywords

schedulingdynamic programmingFPTASweighted number of tardy jobsPareto-optimal pointsweighted late work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling with two competing agents and equal job processing times
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• On an extension of the Sort \& Search method with application to scheduling theory
• Minimizing mean weighted execution time loss on identical and uniform processors
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
• New algorithms for minimizing the weighted number of tardy jobs on a single machine
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Minimizing the number of tardy job units under release time constraints
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing the weighted number of tardy task units
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• A two-agent single-machine scheduling problem with late work criteria
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• 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
• Minimizing total late work on a single machine with generalized due-dates
• Pareto-scheduling of two competing agents with their own equal processing times
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Scheduling to tradeoff between the number and the length of accepted jobs
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
• Bicriteria scheduling of equal length jobs on uniform parallel machines
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A note on the complexity of the problem of two-agent scheduling on a single machine
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• 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 stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Complexity of two dual criteria scheduling problems
• Scheduling with competing agents, total late work and job rejection
• Scheduling Problems with Two Competing Agents
• Single Machine Scheduling to Minimize Total Late Work
• Algorithms for Scheduling Independent Tasks
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Reducibility among Combinatorial Problems
• Single‐machine scheduling with deadlines to minimize the 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
• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work

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