"Fully polynomial time approximation scheme to maximize early work on ..."

Xin Chen et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2019.12.003

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/ChenLSWB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/ChenLSWB20
Xin Chen, Yage Liang, Malgorzata Sterna, Wen Wang, Jacek Blazewicz:
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. Eur. J. Oper. Res. 284(1): 67-74 (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.