Paper Title:
Heuristics for Minimizing Total Completion Time on Single Machine with Release Time
  Abstract

This paper focuses on the problem of scheduling n jobs with release dates on a single machine in order to minimize the total completion time. Since the problem has been characterized as strongly NP-hard, two heuristics (HR1 and AEO) were proposed for solving the problem in polynomial time. The heuristics were compared with the best approximation algorithm for this problem to date (Best-alpha). Experimental results show that AEO performed better than the Bestalpha algorithm (selected from the literature) when the number of jobs (n) exceeds 5. This observation should prove useful in the operational dispatch of jobs in industrial production settings as well as the service sector.

  Info
Periodical
Advanced Materials Research (Volumes 18-19)
Edited by
Akii Ibhadode
Pages
347-352
DOI
10.4028/www.scientific.net/AMR.18-19.347
Citation
E. O. Oyetunji, A. E. Oluleye, "Heuristics for Minimizing Total Completion Time on Single Machine with Release Time ", Advanced Materials Research, Vols. 18-19, pp. 347-352, 2007
Online since
June 2007
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Hong Xin Shi, Shan Shan Jiang, Hai Min Shen, Hong Ke Wu
Chapter 1: Chemical Materials and Technologies
Abstract:Silicon oil emulsion was prepared by mixing silicon oil with emulsifiers and water. To optimize the emulsifiers formulation, the D-optimal...
3
Authors: H.M.E. Kays, A.N. Mustafizul Karim, M.N.B. Tajudin, M. Abdesselam
Chapter 10: Manufacturing and Engineering Management
Abstract:A production flow line balancing problem for automotive industry has been studied. A batch of an end item is produced by transforming sheet...
610