Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

DOI10.3934/jimo.2021192OpenAlexW3214907038MaRDI QIDQ2083387

Shuen Guo, Zhichao Geng, Jinjiang Yuan

Publication date: 10 October 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021192

zbMATH Keywords

schedulingmultiple weightsfully polynomial-time approximation schemePareto-frontierweighted late work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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
• Minimizing mean weighted execution time loss on identical and uniform processors
• Minimizing the number of tardy job units under release time constraints
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing the weighted number of tardy task units
• A two-agent single-machine scheduling problem with late work criteria
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
• Minimizing total late work on a single machine with generalized due-dates
• Single-machine scheduling with multi-agents to minimize total weighted late work
• Single-machine scheduling with maintenance activities and rejection
• Two competitive agents to minimize the weighted total late work and the total completion time
• 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
• The complexity of two supply chain scheduling problems
• Scheduling with competing agents, total late work and job rejection
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Single Machine Scheduling to Minimize Total Late Work
• On Finding the Maxima of a Set of Vectors
• 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 to Minimize Total Weighted Late Work
• Single‐machine scheduling with deadlines to minimize the total weighted late work
• 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: Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works