A Study of worst-case complexity for parallel machine scheduling problems based on an extension of the Sort & Search method - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Study of worst-case complexity for parallel machine scheduling problems based on an extension of the Sort & Search method

No file

Dates and versions

hal-00943035 , version 1 (06-02-2014)

Identifiers

  • HAL Id : hal-00943035 , version 1

Cite

Vincent t'Kindt, Christophe Lenté, Mathieu Liedloff. A Study of worst-case complexity for parallel machine scheduling problems based on an extension of the Sort & Search method. Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2013), 2013, France. ⟨hal-00943035⟩
77 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More