"The time dependent machine makespan problem is strongly NP-complete."

T. C. Edwin Cheng, Qing Ding (1999)

> Home

Details and statistics

DOI: 10.1016/S0305-0548(98)00093-8

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/ChengD99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/ChengD99
T. C. Edwin Cheng, Qing Ding:
The time dependent machine makespan problem is strongly NP-complete. Comput. Oper. Res. 26(8): 749-754 (1999)

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.