"Two-agent preemptive Pareto-scheduling to minimize the number of tardy ..."

Ruyan He et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S10878-021-00697-2

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/HeYNC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/HeYNC21
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41(2): 504-525 (2021)

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.