Application of Queue Theory in Reduction of Prison Congestion

Application of Queue Theory in Reduction of Prison Congestion.

ABSTRACT

The prisons are supposed to be a reformation and rehabilitation centre for convicted prisoners who are convicted for one crimes or the other and not for the unconvicted ones who are still awaiting court trials.

However, what has become of the Nigeria’s prisons is the congestion of both the convicted and unconvicted prisoners.

This project as an Application of Queue Theory System on the reduction of prison congestion in the Nigerian Prison Service helps to increase the speed of attending to cases of prisoners awaiting court judgment.

The application is developed using Adobe CS4 Dreamweaver, fully supported with PHP and JavaScript functionalities.

TABLE OF CONTENTS

TITLE PAGE

CERTIFICATION

DEDICATION

ACKNOWLEDGEMENT

ABSTRACT

CHAPTER ONE: GENERAL INTRODUCTION

  • INTRODUCTION
  • STATEMENT OF THE PROBLEM
  • AIM AND OBJECTIVES
  • SIGNIFICANCE OF THE STUDY
  • SCOPE AND LIMITATION OF THE STUDY

1.6       DEFINITION OF TERMS

1.7      ORGANIZATION OF THE REPORT

CHAPTER TWO: BACKGROUND CONCEPTS AND LITERATURE REVIEW

2.0       LITERATURE REVIEW

2.1       FACTORS ASSOCIATED WITH OVERCROWDING IN NIGERIAN PRISONS

2.3       SOME SIDE EFFECTS OF IMPRISONMENT IN NIGERIA

2.4       OVERVIEW OF QUEUE THEORY

2.5       APPLICATION OF QUEUE THEORY TO TELEPHONY

2.6       LIMITATIONS OF QUEUING THEORY

CHAPTER THREE: PROJECT METHODOLOGY

3.1       METHOD OF DATA COLLECTION

3.2       ANALYSIS OF THE EXISTING SYSTEM

3.3       PROBLEMS OF THE EXISTING SYSTEM

3.4       DESCRIPTION OF THE PROPOSED SYSTEM

3.5       ADVANTAGES OF THE PROPOSED SYSTEM

3.6       DESIGN AND IMPLEMENTATION TECHNIQUES

CHAPTER FOUR: DESIGN, IMPLEMENTATION AND DOCUMENTATION OF THE SYSTEM

4.1       DESIGN OF THE SYSTEM

4.1.1   OUTPUT DESIGN

4.1.2   INPUT DESIGN

4.1.3   DATABASE DESIGN

4.1.4   PROCEDURE DESIGN

4.2       IMPLEMENTATION OF THE SYSTEM

4.2.1   HADRWARE SUPPORT

4.2.2   SOFTWARE SUPPORT

4.3       SYSTEM DOCUMENTATION

            4.3.1   PROGRAM DOCUMENTATION

4.3.2   OPERATING THE SYSTEM

4.3.3   MAINTAINING THE SYSTEM

CHAPTER FIVE: SUMMARY, RECOMMENDATION AND CONCLUSION

5.1       SUMMARY

5.2       RECOMMENDATION

5.3       CONCLUSION

REFERENCES

APPENDICES

  1. FLOWCHARTS
  2. SOURCE PROGRAM LISTINGS
  3. GENERATED OUTPUTS

INTRODUCTION

In a real-life experience, it is technically proposed that as any system gets congested, the service delay in the system increases. A good understanding of the relationship between congestion and delay is essential for designing effective congestion control algorithms.

Queuing Theory provides all the tools needed for this analysis. (Obioha, 1995) The growing of crime in the society has led to increase in waiting time and overcrowding in Nigerian prison yards.

Long waiting time of inmates in any prison is considered as an indicator of poor quality and needs improvement. Managing inmates awaiting trial create a great dilemma for prison wardens seeking to improve condition of inmates on daily basis. (Adetule et al, 2010).

Prison is an institution designed to secure house for people who have been convicted of crimes. These individuals, known as prisoners or inmates, are kept in continuous custody on a long-term basis.

REFERENCES

Adetula G. A., Adetula A., Fatusin A. F. 2010. The prison subsystem culture: Its attitudinal effects on operatives, convicts and the free society. Ife.

Biju M. K., Naeema K. and Faisal U. (2011). Application of Queuing Theory in Human Resource Management in Health Care. Kannur University, Thalasseri.

Bose S. J., (2002) Chapter 1 – An Introduction to Queuing Systems, Kluwer/Plenum Publishers, London.

Dr. Philip       (1995). “The Nigerian Prison System; Social History”, Chucks Printer, Edo.

Engr. Normal. L. (1998). “Management Standard for Developing Information System”, Wimbling Printing press, London.

Flood, J. E. (2010) Telecommunications Switching, Traffic and Networks, Chapter 4: Telecommunications Traffic, New York: Prentice-Hall, 1998.

Goffman E., (1961). Asylums. New York: Garden City Anchor Books.

Kelly F. P. (2002). Networks of Queues with Customers of Different Types Journal of Applied Probability, Vol. 12, No. 3.

Lawrence W. Dowdy, Virgilio A.F. Almeida, Daniel A. Menasce (2004). “Performance by Design: Computer Capacity Planning By Example”. http://www.cs.gmu.edu/~menasce/perfbyd/

Mayhew, Les; Smith, David (2006). Using queuing theory to analyse completion times in accident and emergency departments in the light of the Government 4-hour target. Cass Business School. http://www.cass.city.ac.uk/media/stories/story_96_105659_69284.html.

Obioha E. E. (1995). Prison Culture in Nigeria; A Study of Life Within Agodi Prison Community, Ibadan. M.Sc Dissertation, Unpublished. Ibadan: Department of Sociology, University of Ibadan.

Obioha E. E. (2011). Challenges and Reforms in the Nigerian Prisons System. Department of Safety and Security Management, Tshwane University of Technology, Pretoria, South Africa.

Penttinen A., (2006) Chapter 8 – Queuing Systems, Lecture Notes: S-38.145 – Introduction to Teletraffic Theory.

Radcliff-Brown R. (1952). Structure and Function in Primitive Society. New York: The Free Press.

Seshaiah C. V. and Thiagaraj H. B., (2011). A Queuing Network Congestion Model in Hospitals. EuroJournals Publishing, Inc.

Tijms, H. C, (2003). Algorithmic Analysis of Queues”. Chapter 9 in A First Course in Stochastic Models, Wiley, Chichester.

StudentsandScholarship Team.

Be the first to comment

Leave a Reply

Your email address will not be published.


*