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

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00943035
Contributor : Mathieu Liedloff <>
Submitted on : Thursday, February 6, 2014 - 9:14:35 PM
Last modification on : Tuesday, November 19, 2019 - 4:48:11 PM

Identifiers

  • HAL Id : hal-00943035, version 1

Citation

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⟩

Share

Metrics

Record views

99