A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
From MaRDI portal
Publication:4294731
DOI10.1287/moor.19.1.86zbMath0799.90064OpenAlexW2066620795MaRDI QIDQ4294731
Mikhail Y. Kovalyov, Luk N. Van Wassenhove, Chris N. Potts
Publication date: 17 November 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.1.86
Related Items (26)
Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Approximation algorithms for minimizing the total weighted tardiness on a single machine ⋮ Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Improving the complexities of approximation algorithms for optimization problems ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ 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 ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Mirror scheduling problems with early work and late work criteria ⋮ Single machine scheduling subject to deadlines and resource dependent processing times ⋮ Parallel machine batching and scheduling with deadlines ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
This page was built for publication: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
