Skip to Main content Skip to Navigation
Conference papers

A Graphical Approach for Solving Single Machine Scheduling Problems Approximately

Evgeny R. Gafarov 1, 2, 3 Alexandre Dolgui 4 Alexander Lazarev 3 Frank Werner 5
1 DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
3 ICS RAS - Trapeznikov Institute of Control Sciences
4 Laboratoire en Sciences et Technologies de l'Information
LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes, DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
5 College of Science and Engineering
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.
Keywords : Inventory control production planning and scheduling Operational research Industrial and applied mathematics for production
Document type :
Conference papers
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-00881617
Contributor : Florent Breuil <>
Submitted on : Friday, November 8, 2013 - 3:31:00 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:22 PM

Links full text

openaccess

Identifiers

Collections

EMSE | DEMO-ENSMSE | FAYOL-ENSMSE | CNRS | LIMOS | PRES_CLERMONT | TDS-MACS | INSTITUT-TELECOM | SIGMA-CLERMONT

Citation

Evgeny R. Gafarov, Alexandre Dolgui, Alexander Lazarev, Frank Werner. A Graphical Approach for Solving Single Machine Scheduling Problems Approximately. 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013, Jun 2013, St Petersburg, Russia. pp. 1340-1345, ⟨10.3182/20130619-3-RU-3018.00010⟩. ⟨emse-00881617⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

213

Contact

Informations

CCSD