Single Machine Scheduling to Minimize Total Late Work
From MaRDI portal
Publication:4017089
DOI10.1287/opre.40.3.586zbMath0756.90051OpenAlexW2146696160MaRDI QIDQ4017089
Chris N. Potts, Luk N. Van Wassenhove
Publication date: 16 January 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.3.586
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Minimizing the weighted number of tardy task units ⋮ 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 ⋮ A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ Scheduling imprecise computation tasks on uniform processors ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ 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 ⋮ A single machine scheduling problem to minimize total early work ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Scheduling imprecise computation tasks with \(0/1\)-constraint ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ Scheduling with competing agents, total late work and job rejection ⋮ 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 ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ A note on a two-agent scheduling problem related to the 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 ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Open shop scheduling problems with late work criteria. ⋮ Multivariate composite distributions for coefficients in synthetic optimization problems ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Approximation algorithms for scheduling a single machine to minimize total late work ⋮ A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS ⋮ Scheduling two agents with controllable processing times ⋮ 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 ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ 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 ⋮ A note on a single machine scheduling problem with generalized total tardiness objective function ⋮ 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
