Scheduling with tails and deadlines

DOI10.1002/jos.71zbMath0994.90075MaRDI QIDQ5937434

Francis Sourd, Wim Nuijten

Publication date: 12 July 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.71

zbMATH Keywords

scheduling; lower bound; release dates; deadlines; due dates; minimax objective function; shop scheduling problem; tails

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

90B35: Deterministic scheduling theory in operations research

Cites Work

• Unnamed Item
• The one-machine sequencing problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Constraint-based job shop scheduling with Ilog Scheduler
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• An Algorithm for Solving the Job-Shop Problem
• Two-Processor Scheduling with Start-Times and Deadlines
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with deadlines, release and due dates
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints