Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints

Title
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
Authors
Keywords
Single machine scheduling, Release times, Lateness, Deadlines, Approximation algorithms
Journal
ALGORITHMICA
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-02-21
DOI
10.1007/s00453-018-0417-6

Ask authors/readers for more resources

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started