Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

Authors:
Philip Kaminsky;David Simchi-Levi
Affiliations:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720-1777, USA;The Engineering Systems Division and the Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Operations Research Letters
Year:
2001

Citing 8
Cited 3

Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
Approximation techniques for average completion time scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal On-Line Algorithms for Single-Machine Scheduling

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem

Operations Research
The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

Operations Research
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

A Tool for Controlling Response Time in Real-Time Systems

TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Effective on-line algorithms for reliable due date quotation and large-scale scheduling

Journal of Scheduling
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the single machine mean completion time problem with release dates, a set of jobs has to be processed non-preemptively on a single machine. No job can be processed before its release date, and the objective is to determine a sequence of the jobs on the machine which minimizes the sum of the completion times of all jobs. In this paper, we prove the asymptotic optimality of the shortest processing time among available jobs algorithm, in which at the completion time of any job, the next job to be scheduled is the shortest job among all those released but not yet processed. This algorithm is particularly attractive because it falls in the class of easy to implement and computationally inexpensive on-line algorithms.