The worst case analysis of Garey-Johnson algorithm for preemptive m processors

Claire Hanen 1 Yakov Zinder
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01420471
Contributor : Lip6 Publications <>
Submitted on : Tuesday, December 20, 2016 - 4:18:27 PM
Last modification on : Thursday, March 21, 2019 - 2:34:08 PM

Identifiers

  • HAL Id : hal-01420471, version 1

Citation

Claire Hanen, Yakov Zinder. The worst case analysis of Garey-Johnson algorithm for preemptive m processors. Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. pp.453-470. ⟨hal-01420471⟩

Share

Metrics

Record views

63