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.
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 : Thursday, October 17, 2019 - 12:36:36 PM

Identifiers

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⟩

Share

Metrics

Record views

189