"A Polynomial Time Approximation Scheme for Minimizing Total Completion ..."

Xiaotie Deng et al. (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-45678-3_3

access: closed

type: Conference or Workshop Paper

metadata version: 2020-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/DengFZZ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/DengFZZ01
Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu:
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. ISAAC 2001: 26-35

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.