Schedules with precedence restriction and position-dependent servicing durability

Abstract : We demonstrate that several single machine scheduling problems with positionally dependent processing times can be solved in polynomial time, provided that the graph that defines precedence constraints admit modular decomposition into factors of a bounded width.
Type de document :
Article dans une revue
Doklady of the national academy of sciences of Belarus, 2010, vol. 54 (n°4), p. 47-52
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00676028
Contributeur : Florent Breuil <>
Soumis le : vendredi 2 mars 2012 - 16:35:05
Dernière modification le : mardi 23 octobre 2018 - 14:36:08

Identifiants

  • HAL Id : emse-00676028, version 1

Citation

Valery Gordon, Alexandre Dolgui, Vitaly Strusevich. Schedules with precedence restriction and position-dependent servicing durability. Doklady of the national academy of sciences of Belarus, 2010, vol. 54 (n°4), p. 47-52. 〈emse-00676028〉

Partager

Métriques

Consultations de la notice

115