"Approximating the Optimal Algorithm for Online Scheduling Problems via ..."

Lin Chen, Deshi Ye, Guochuan Zhang (2015)

> Home

Details and statistics

DOI: 10.1142/S0217595915400114

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apjor/ChenYZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apjor/ChenYZ15
Lin Chen, Deshi Ye, Guochuan Zhang:
Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming. Asia Pac. J. Oper. Res. 32(1): 1540011:1-1540011:19 (2015)

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.