"Using a Variable Neighborhood Search to Solve the Single Processor ..."

Rachid Benmansour et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-030-15843-9_16

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icvns/BenmansourBHM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icvns/BenmansourBHM18
Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic:
Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. ICVNS 2018: 202-215

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.