A Graphical Approach for Solving Single Machine Scheduling Problems Approximately

Abstract : For five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems.
Type de document :
Communication dans un congrès
N. Bakhtadze, A. Dolgui, V. Lototsky. 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013, Jun 2013, St Petersburg, Russia. Elsevier Science, IFACPapersOnline.net, Volume 7 (Part 1), pp. 1340-1345, 2013, 〈10.3182/20130619-3-RU-3018.00010〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00881617
Contributeur : Florent Breuil <>
Soumis le : vendredi 8 novembre 2013 - 15:31:00
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05

Identifiants

Citation

Evgeny R. Gafarov, Alexandre Dolgui, Alexander Lazarev, Frank Werner. A Graphical Approach for Solving Single Machine Scheduling Problems Approximately. N. Bakhtadze, A. Dolgui, V. Lototsky. 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013, Jun 2013, St Petersburg, Russia. Elsevier Science, IFACPapersOnline.net, Volume 7 (Part 1), pp. 1340-1345, 2013, 〈10.3182/20130619-3-RU-3018.00010〉. 〈emse-00881617〉

Partager

Métriques

Consultations de la notice

140