Single machine scheduling with deadlines, release and due dates

DOI10.1080/02331939708844360zbMath0891.90083OpenAlexW2046459844MaRDI QIDQ4375438

Elena Potapneva, Frank Werner, Valery S. Gordon

Publication date: 5 February 1998

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844360

zbMATH Keywords

due datedeadlinesprocessing timerelease dateweighted number of late jobssingle machine preemptive scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals ⋮ Scheduling with tails and deadlines ⋮ Off-line admission control for general scheduling problems

Cites Work

• Single-machine scheduling to minimize earliness and number of tardy jobs
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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

This page was built for publication: Single machine scheduling with deadlines, release and due dates