"Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted ..."

Nhan-Quy Nguyen et al. (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-662-49390-8_28

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aciids/NguyenYACT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aciids/NguyenYACT16
Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade, Pascal Toggenburger:
Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models. ACIIDS (2) 2016: 286-295

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.