A Graphical Approach for Solving Single Machine Scheduling Problems Approximately - Mines Saint-Étienne Access content directly
Conference Papers Year : 2013

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.

Dates and versions

emse-00881617 , version 1 (08-11-2013)

Identifiers

Cite

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⟩
69 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More