"Improved Fully Polynomial Approximation Schemes for the Maximum Lateness ..."

Imed Kacem, Hans Kellerer (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-030-00898-7_28

access: closed

type: Conference or Workshop Paper

metadata version: 2018-10-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iccl2/KacemK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccl2/KacemK18
Imed Kacem, Hans Kellerer:
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ICCL 2018: 417-427

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.