"Infinite split scheduling: a new lower bound of total weighted completion ..."

Rabia Nessah, Chengbin Chu (2010)

> Home

Details and statistics

DOI: 10.1007/S10479-010-0752-8

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/NessahC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/NessahC10
Rabia Nessah, Chengbin Chu:
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods. Ann. Oper. Res. 181(1): 359-375 (2010)

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.