"The strong NP-hardness of the maximum lateness minimization scheduling ..."

Radoslaw Rudek (2012)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2011.12.020

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/Rudek12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/Rudek12
Radoslaw Rudek:
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect. Appl. Math. Comput. 218(11): 6498-6510 (2012)

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.