Volume 50, Number 4-5, October-December 2016
Special issue - Advanced Optimization Approaches and Modern OR-Applications
|Page(s)||681 - 687|
|Published online||03 November 2016|
Improving the solution complexity of the scheduling problem with deadlines: A general technique∗
1 Bar Ilan University, Ramat Gan, Israel.
2 Ashkelon Academic College, Ashkelon, Israel.
Accepted: 23 February 2016
The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math. 3 (1981) 313–318]: “Can an epsilon-approximation algorithm be found for the minimization version of the job-sequencing-with-deadlines problem running with the same complexity as the algorithms for the maximization form of the problem?”
Mathematics Subject Classification: 41A29 / 41A10 / 65D15 / 65Y10 / 68Q25
Key words: Job-sequencing-with-deadlines scheduling problem / approximation algorithm / FPTAS
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.