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

Authors:
Imed Kacem
Affiliations:
ICD-LOSI CNRS FRE 2848, Université de Technologie de Troyes, 12 rue Marie Curie, B.P. 2060, Troyes 10010, France
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 10
Cited 12

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
Capacitated two-parallel machines scheduling to minimize sum of job completion times

Discrete Applied Mathematics
Optimal parallel machines scheduling with availability constraints

Discrete Applied Mathematics
Scheduling two-stage hybrid flow shop with availability constraints

Computers and Operations Research
Improved algorithms for two single machine scheduling problems

Theoretical Computer Science - Algorithmic applications in management
Note: A note on worst-case performance of heuristics for maintenance scheduling problems

Discrete Applied Mathematics
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research
Minimizing the sum of job completion times on capacitated parallel machines

Mathematical and Computer Modelling: An International Journal

Exponential inapproximability and FPTAS for scheduling with availability constraints

Theoretical Computer Science
Short Communication: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research
Approximation algorithms for scheduling with a variable machine maintenance

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Journal of Scheduling
Approximation schemes for parallel machine scheduling with availability constraints

Discrete Applied Mathematics
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications
Universal sequencing on a single machine

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint

Computers and Industrial Engineering
Minimizing total weighted completion time with an unexpected machine unavailable interval

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

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^2) 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 problem.