Journal Information
Research Areas
Publication Ethics and Malpractice Statement
To Scholarlink Resource Center
Guidelines for Authors
For Authors
Instructions to Authors
Copyright forms
Submit Manuscript
Call for papers
Guidelines for Reviewers
For Reviewers
Review Forms
Contacts and Support
Support and Contact
List of Issues


Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS)


Article Title: Minimizing Makespan and Total Completion Time Criteria on a Single Machine with Release Dates
by E. O. Oyetunji and A. E. Oluleye

This paper considers the scheduling problem of simultaneously minimizing the makespan and total completion time criteria on a single machine with release dates. Since the problem has been characterized as NP-Hard, approximation algorithms are desired for solving the problem. A new implementation of an existing algorithm (GAlg) was adopted for this scheduling problem. This is appropriately named NGAlg algorithm. The NGAlg algorithm was compared with the Best Beta (BESTB) algorithm selected from the literature. The two criteria were aggregated together into a linear composite objective function (LCOF). Five variants of the LCOF were utilized. Performance evaluations were based on both effectiveness and efficiency of the algorithms. Both NGAlg and BESTB algorithms were tested on a set of 900 randomly generated single machine scheduling problems. Experimental results show that the NGAlg algorithm outperformed the BESTB algorithm under all the five different LCOFs and the considered problem sizes.
Keywords: criteria, algorithm, single machine, dimensionless, makespan, total completion time
Download full paper

ISSN: 2141-7016

Editor in Chief.

Prof. Gui Yun Tian
Professor of Sensor Technologies
School of Electrical, Electronic and Computer Engineering
University of Newcastle
United Kingdom



Copyright © Journal of Emerging Trends in Engineering and Applied Sciences 2010