Home           Contact us           FAQs           
    
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
    Abstract
2009 (Vol. 1, Issue: 1)
Article Information:

Comparison of the Running Time of Some Flow Shop Scheduling Algorithms using the Big O Notation Method

E.O. Oyetunji and A.E. Oluleye
Corresponding Author:  Oyetunji Elkanah 

Key words:  Efficiency, Big O notation, Algorithms, Scheduling, Flow shop, ,
Vol. 1 , (1): Page No: 4-8
Submitted Accepted Published
2009 June, 02
Abstract:

The quality of solution obtained by scheduling algorithms can be evaluated in term s of both effectiveness (a measure of the closeness of the value of the objective function to the optimal) and efficiency (a measure of the execution speed or running time). This paper focused on the later. We showed how the running time of an algorithm can be calculated using the Big O notation method. Since sorting techniques form the building blocks of many algorithms, the running time of some of the commonest ones were also calculated. The running time of some flow shop heuristics proposed long ago were estimated and used as a basis of comparing their efficiencies.
Abstract PDF HTML
  Cite this Reference:
E.O. Oyetunji and A.E. Oluleye, 2009. Comparison of the Running Time of Some Flow Shop Scheduling Algorithms using the Big O Notation Method.  Research Journal of Mathematics and Statistics, 1(1): Page No: 4-8.
    Advertise with us
 
ISSN (Online):  2040-7505
ISSN (Print):   2042-2024
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved