"A Stronger Complexity Result for the Single Machine Multi-Operation Jobs ..."

T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan (2003)

> Home

Details and statistics

DOI: 10.1023/A:1026276627133

access: closed

type: Journal Article

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/ChengNY03a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/ChengNY03a
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Sched. 6(6): 551-555 (2003)

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.