Minimizing total flow time in single machine environment with release time: an experimental analysis

Authors:
Y. Guo;A. Lim;B. Rodrigues;S. Yu
Affiliations:
School of Computing, National University of Singapore, 3 Science Drive 2, Singapore, Singapore;Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China;School of Business, Singapore Management University, 269 Bukit Timah Road, Singapore, Singapore;School of Computing, National University of Singapore, 3 Science Drive 2, Singapore, Singapore
Venue:
Computers and Industrial Engineering
Year:
2004

Citing 5
Cited 2

Approximability and nonapproximability results for minimizing total flow time on a single machine

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximating total flow time on parallel machines

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling Jobs that Arrive Over Time (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem

Operations Research Letters

Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Computers and Operations Research
Machine scheduling performance with maintenance and failure

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of minimizing total flow time on a single machine with job release times. This problem is NP-complete for which is no constant ratio approximation algorithm. Our objective is to study experimentally how well, on average, the problem can be solved. The algorithm we use produces non-preemptive schedules converted from preemptive ones. We evaluate average solution quality for the problem to identify the characteristics of difficult instances. Results obtained are compared with those recently obtained by other researchers. Based on extensive experiments, we also develop an empirical model to predict solution quality using interpolation.