Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals

DOI10.1051/ro:2001103zbMath0995.90039OpenAlexW2001396591WikidataQ57633956 ScholiaQ57633956MaRDI QIDQ2765599

O. A. Yanushkevich, Frank Werner, Valery S. Gordon

Publication date: 16 June 2002

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_71_0

zbMATH Keywords

deadlinessingle machine schedulingnumber of late jobsrelease and due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Complexity results for scheduling chains on a single machine
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
• Linear-Time Algorithms for Scheduling on Parallel Processors
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with deadlines, release and due dates
• 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 Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals