Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
type: Item
instance of: scholarly article
title: Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
author: Shuen Guo
author: Zhichao Geng
author: Jinjiang Yuan
published in: Journal of Industrial and Management Optimization
publication date: 2022-10-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7599082
zbMATH Keywords: scheduling
zbMATH Keywords: multiple weights
zbMATH Keywords: weighted late work
zbMATH Keywords: Pareto-frontier
zbMATH Keywords: fully polynomial-time approximation scheme
MaRDI profile type: Publication
full work available at URL: jimo.2021192
OpenAlex ID: W3214907038
cites work: Q3680271
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: The two-machine flow-shop problem with weighted late work criterion and common due date
cites work: Q5143971
cites work: Single‐machine scheduling with deadlines to minimize the total weighted late work
cites work: Scheduling on parallel identical machines with late work criterion: offline and online cases
cites work: Scheduling with competing agents, total late work and job rejection
cites work: Single Machine Scheduling to Minimize Total Weighted Late Work
cites work: Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
cites work: Minimizing the number of tardy job units under release time constraints
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: On Finding the Maxima of a Set of Vectors
cites work: Minimizing the weighted number of tardy task units
cites work: Single-machine scheduling with multi-agents to minimize total weighted late work
cites work: Minimizing total late work on a single machine with generalized due-dates
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Approximation algorithms for scheduling a single machine to minimize total late work
cites work: The complexity of two supply chain scheduling problems
cites work: THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
cites work: A two-agent single-machine scheduling problem with late work criteria
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Two-agent scheduling problems on a single-machine to minimize the total weighted late work
cites work: Two competitive agents to minimize the weighted total late work and the total completion time
cites work: A note on a two-agent scheduling problem related to the total weighted late work
cites work: Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
cites work: Single-machine scheduling with maintenance activities and rejection
DOI: 10.3934/JIMO.2021192
description: scientific article; zbMATH DE number 7599082