ISSN : 2488-8648


International Journal of Basic Science and Technology

A publication of the Faculty of Science, Federal University Otuoke, Bayelsa State

Home About IJBST For Authors Issues Useful Downloads Contact


FAQ OJBST

Questions are asked and these questions need answers. This is the reason why this page is created to enable us share few worries!

×
Archive | ISSUE: , Volume: Jul-Sep-2022

Optimal Sequence Method of Waiting Time Processes


Author:Emenonye, C.E.

published date:2022-Jul-09

FULL TEXT in - | page 87 - 91

Abstract

Sequence / scheduling is the process of “turning arrivals and /or departure of units to their required service”. It is used to refer to the “order” in which problems are solved. Some types of scheduling are considered, the formula for determining the total elapsed time derived and relevant theorems stated and proved. It is also shown that with any sequence S0, the optimal sequence S* can be obtained by the successive interchanges of consecutive jobs. For such interchange each value of Dn (s) is smaller than or equal to the one preceding the interchange.

Keywords: Sequence, Theorems, Optimal Sequence, Interchange,

References

References

Anderson, E.T. (1988). Introduction to management science (Quantitative Approach to Decision-making) West Publishing Company New York

Bellman, R. (1955).  Mathematical Aspects of Scheduling Theory.  Rand Corporation Santa Monica

Chikwendu, C.R. (2012). Elementary Operations Research with applications.  Nnewi, God’s Time Publishing Concept,

Churchman, C. W. (1961).  Introduction to Operations Research. John Wiley and Sons inc. London

Eck, R.D. (1976).  Operations Research for business. Wadsworth Publishing Company Inc. Belmont

Frederick, S.H. and Lieberman, B. (2008). Introduction to operations Research. 6th Edition by McGraw Hill New York

Martek, S. (2013). Optimal Scheduling for Laboratory automation of life sciences. Informs Journal on Computing 7 (2). 191- 200.

Nongye, X., Toni, R, F. and Xiaoyun, X. (2007). Job scheduling methods for reducing waiting time variance. Computers and Operations Research 34 (10): 3069- 3083

Prather, R.E. (1976). Discrete Mathematical Structures for Computer Science. Houghton Mifflin Company Bastion

Samuel, E. and Chowdhy, I. (1977). Minimizing waiting time variance in nthe single machine problem. Management Science Journal, Volume 23, Number 6, 567-575

Wheeler, R.E. (1991). Finite mathematics for business and the social and life sciences.  Sanders College Publishing Philadelphia

 

 

FULL TEXT in - | page 87 - 91

Issue Archive

Volume 12 2026

Volume 11 2025

Volume 10 2024

Issue 3-Jul-Sep
Issue 2-Apr-Jun
Issue 1-Jan-Mar

Volume 9 2023

Issue 4-Oct-Dec
Issue 3-Jul-Sep
Issue 2-Apr-Jun
Issue 1-Jan-Mar

Volume 8 2022

Issue 4-Oct-Dec
Issue 3-Jul-Sep
Issue 2-Apr-Jun
Issue 1-Jan-Mar

Volume 7 2021

Issue 4-Oct-Dec
Issue 2-Apr-Jun
Issue 1-Jan-Mar

Volume 6 2020

Issue 4-Oct-Dec
Issue 3-Jul-Sep

Volume 5 2019

Issue 4-Oct-Dec
Issue 2-Apr-Jun
Issue 1-Jan-Mar

Volume 4 2018

Issue 4-Oct-Dec
Issue 3-Jul-Sep
Issue 2-Apr-Jun

Volume 3 2017

Issue 4-Oct-Dec
Issue 1-Jan-Mar

Volume 2 2016

Issue 4-Oct-Dec

Volume 1 2015

Issue 4-Oct-Dec


Copyright © International Journal of Basic Science and Technology | Faculty of Science, Federal University Otuoke 2019. All Rights Reserved.
P.M.B. 126, Yenagoa. Bayelsa state Nigeria