Activities per year
Abstract
The aim of this paper is to develop an improved polynomial-time approximation algorithm belonging to the family of the fully polynomial time approximation schemes (FPTAS), for an ancient scheduling problem with deadlines. The algorithm permits to answer a question posed more than three decades ago in Gens & Levner (1981): “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?” The new algorithm provides the positive answer.
| Original language | American English |
|---|---|
| State | Published - 2014 |
| Event | Control, Decision and Information Technologies (CoDIT), 2014 International Conference on - Metz, France Duration: 3 Nov 2014 → 7 Nov 2014 |
Conference
| Conference | Control, Decision and Information Technologies (CoDIT), 2014 International Conference on |
|---|---|
| Country/Territory | France |
| City | Metz |
| Period | 3/11/14 → 7/11/14 |
Fingerprint
Dive into the research topics of 'An Improved Approximation Algorithm for the Ancient Scheduling Problem with Deadlines'. Together they form a unique fingerprint.Activities
- 1 Organizing a conference, workshop, ...
-
Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
Elalouf, A. (Participation - Conference participant)
3 Nov 2014 → 7 Nov 2014Activity: Participating in or organizing an event › Organizing a conference, workshop, ...