Scheduling problems with partially ordered jobs

V.S. Gordon Alexandre Dolgui 1
1 Laboratoire en Sciences et Technologies de l'Information
MSGI-ENSMSE - Département Méthodes Scientifiques pour la Gestion Industrielle
Abstract : Scheduling problems with given precedence constraints (with partially ordered jobs) are considered. A review of the results obtained in this area by the members of Minsk Scheduling Theory school created by V.S. Tanaev is done.
Document type :
Journal articles
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-00673953
Contributor : Florent Breuil <>
Submitted on : Friday, February 24, 2012 - 3:42:39 PM
Last modification on : Thursday, October 17, 2019 - 12:36:37 PM

Links full text

istex

Identifiers

Collections

DEMO-ENSMSE | FAYOL-ENSMSE | ROGI-ENSMSE | UR-LSTI-ENSMSE | EMSE | MSGI-ENSMSE | G2I-ENSMSE | INSTITUT-TELECOM

Citation

V.S. Gordon, Alexandre Dolgui. Scheduling problems with partially ordered jobs. Automation and Remote Control / Avtomatika i Telemekhanika / Avtomatika i Telemekhanika, 2010, 71 (10), pp.Pages 2029 - 2037. ⟨10.1134/S0005117910100036⟩. ⟨emse-00673953⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

158

Contact

CCSD