"A technical note: fully polynomial time approximation schemes for ..."

Nir Halman (2020)

> Home

Details and statistics

DOI: 10.1007/S10951-019-00616-8

access: closed

type: Journal Article

metadata version: 2021-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/Halman20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/Halman20
Nir Halman:
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. J. Sched. 23(6): 643-648 (2020)

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.