Ten notes on equal-processing-time scheduling

Abstract : Fourteen equal-processing-time scheduling problems whose complexity status has been unknown before are shown to be solved in polynomial time by well-known and relatively new techniques. We consider single-machine, parallel-machine, parallel-batch, open-shop, flow-shop, robotic flow-shop and job-shop machine environments.
Type de document :
Article dans une revue
4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2004, 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, pp.111--127
Liste complète des métadonnées

https://hal.inria.fr/inria-00124157
Contributeur : Philippe Baptiste <>
Soumis le : vendredi 12 janvier 2007 - 14:31:08
Dernière modification le : jeudi 10 mai 2018 - 02:06:57

Identifiants

  • HAL Id : inria-00124157, version 1

Collections

Citation

Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim Timkovski. Ten notes on equal-processing-time scheduling. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2004, 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, pp.111--127. 〈inria-00124157〉

Partager

Métriques

Consultations de la notice

94