Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

@article{Kacem2008ApproximationAF,
  title={Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval},
  author={Imed Kacem},
  journal={Computers & Industrial Engineering},
  year={2008},
  volume={54},
  pages={401-410}
}
In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the weighted sum of completion times. No polynomial 2-approximation algorithm for this problem has been previously known. We propose a 2-approximation algorithm with O(n) time complexity where n is the number of jobs. We show that this bound is tight. The obtained result outperforms all the previous polynomial approximation algorithms for this… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval

2018 5th International Conference on Control, Decision and Information Technologies (CoDIT) • 2018
View 1 Excerpt

Universal Sequencing on an Unreliable Machine

Encyclopedia of Algorithms • 2016
View 1 Excerpt

Effective algorithms for scheduling problems under non-availability constraints (Invited paper)

2nd International Conference on Systems and Computer Science • 2013
View 12 Excerpts

Simultaneously scheduling production plan and maintenance policy for a single machine with failure uncertainty

2013 10th IEEE International Conference on Control and Automation (ICCA) • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…