An Optimal Incremental Algorithm for Minimizing Lateness with Rejection

DOI10.1007/978-3-540-87744-8_50zbMath1158.68345OpenAlexW1501817261MaRDI QIDQ3541120

Julián Mestre, Samir Khuller

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_50

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

A survey on offline scheduling with rejection ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Two-machine flow-shop scheduling with rejection ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Cites Work

• Clustering to minimize the maximum intercluster distance
• Preemptive scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Oblivious Medians Via Online Bidding
• A general approach for incremental approximation and hierarchical clustering
• The Online Median Problem
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Algorithms and Data Structures
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: An Optimal Incremental Algorithm for Minimizing Lateness with Rejection