Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times

Authors:
Imed Kacem;Hans Kellerer
Affiliations:
LITA, University of Metz, France;ISOR, University of Graz, Austria
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 6
Cited 0

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
An approximation algorithm for a single-machine scheduling problem with release times and delivery times

Discrete Applied Mathematics
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times

Journal of Scheduling
Algorithmic problems in power management

ACM SIGACT News
On single-machine scheduling without intermediate delays

Discrete Applied Mathematics
Exact resolution of the one-machine sequencing problem with no machine idle time

Computers and Industrial Engineering

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine maximum lateness minimization problem when jobs have different release dates and tails (or delivery times) under the no idle time assumption (i.e., the schedule cannot contain any idle time between two consecutive jobs on the machine). Our work is motivated by interesting industrial applications to the production area (Chretienne (2008) [3]). Our analysis shows that modifications of the classical algorithms of Potts and Schrage can lead to the same worst-case performance ratios obtained for the relaxed problem without the no idle time constraint. Then, we extend the result developed by Mastrolilli (2003) [13] for such a relaxed problem and we propose a polynomial time approximation scheme with efficient time complexity.