Skip to main content
Log in

Job scheduling in a yam flour producing company in Benin City

  • Case Study
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

A job scheduling mathematical model was applied to a yam flour producing company in Benin City area of Nigeria with a view to develop a framework for the proper scheduling of jobs (orders) in the paint manufacturing company. The problem is addressed by considering customers (n) to be served (where n is large); in what way should customers’ order be processed such that the company’s profit is maximized while the customers are not delayed? The paper addressed the problem by using makespan as a measure of performance while the job orders were sequentially scheduled according to order of priority to achieve optimum results. The mean makespan for the developed CDS heuristic is 35.99, for the developed “A1” is 36.08 while the mean makespan for the usual traditional serial order (USO) method is 40.91. The average gain with the application of CDS heuristic is 4.962 and for “A1” is 4.912. The results show that CDS and “A1” heuristics are preferred to the usual method of USO. The CDS heuristic was fond to give the best makespan results, followed by “A1” heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Adedoye OT, Ojoawo A, Adesiyun OO, Mark F, Anigilaje EA (2008) Poisoning due to yam flour consumption in five families in Ilorin Central Nigeria. West Afr J Med 27(1):41–43

    Google Scholar 

  • Akissoe NH, Hounhouigan JD, Brica N, Vernier P, Nago MC, Olorunda OA (2003) Physical, chemical and sensory evaluation of dried yam (Dioscorea rotundata) tubers, flour and amala—a flour-derived product. J Trop Sci 41:151–156

    Google Scholar 

  • Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for n-job, m-machine sequencing problem. J Manag Sci. 16:630–637

    Google Scholar 

  • Chen ZL (1999) Simultaneous job scheduling and resource allocation on parallel machines. Department of Systems Engineering, University of Pennsylvania, Philadelphia, p 19104

    Google Scholar 

  • Chen JC, Cheng-Chun W, Chia-Wen C, Kou-Huang C (2012) Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm. J Expert Syst Appl 39(11):10016–10021

    Article  Google Scholar 

  • Choi I, Choi D (2002) A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. J Comput Ind Eng 42(1):43–58

    Article  Google Scholar 

  • Collins JL, Falasinnu GA (2006) Yam (Dioscorea spp.) flour fortification with soy flour. J Food Sci 42(3):821–827

    Article  Google Scholar 

  • Du J (1993) Minimizing mean flow time in two-machine open shops and flow shops. J Algorithms 14:24–44

    Article  MathSciNet  MATH  Google Scholar 

  • Hounhouigan JD, Kayode AP, Bricas N, Nago CM (2003) Desirable culinary and sensory characteristics of yams in urban Benin. Benin J Agric Sci 21(12):2815–2820

    Google Scholar 

  • Kanate P, Mungwattana A (2010) Algorithm for solving job shop scheduling problem based on machine availability constraint. Int J Comput Sci Eng 2(5):1919–1925

    Google Scholar 

  • Karger D, Stein C, Wein J (1999) Chapter scheduling algorithms. Algorithms and theory of computation handbook. CRC Press, Boca Raton

    Google Scholar 

  • Kesen SE, Güngor Z (2012) Job scheduling in virtual manufacturing cells with lot-streaming strategy: a new mathematical model formulation and a genetic algorithm approach. J Operational Res Soc 63:683–695

    Article  Google Scholar 

  • Liaw CF (2008) An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. J Comput Operations Res 35(10):3276–3283

    Article  MATH  Google Scholar 

  • Liu N, Abdelrahman M, Ramaswamy S (2005) A genetic algorithm for single machine total weighted tardiness scheduling problem. Int J Intell Control Syst 10(3):218–225

    Google Scholar 

  • Mestres C, Dorthe S, Akissoe N, Hounhouigan JD (2004) Prediction of sensorial properties (colour and taste) of amala, a paste from yam chips flour of West Africa, through biochemical properties. J Plant Foods Hum Nutr 9(3):93–99

    Article  Google Scholar 

  • Mignouna HD, Abang MM, Asiedu R (2003) Harnessing modern biotechnology for tropical tuber crop improvement: yam (Dioscorea spp.) molecular breeding. Afr J Biotechnol 2(12):478–485

    Google Scholar 

  • Odior AO, Orsarh ES (2008) Design and construction of a yam pounding machine. Int J Nat Appl Sci 4(3):319–323

    Google Scholar 

  • Ojokoh AO, Gabriel RAO (2010) A comparative study on the storage of yam chips (gbodo) and yam flour (elubo). Afr J Biotechnol 9(21):3175–3177

    Google Scholar 

  • Oladimeji FO, Oke SA, Oluwatoyin PP (2008) A multi-criteria model for maintenance job scheduling. Maejo Int J Sci Technol 2(1):1–12

    Google Scholar 

  • Oluleye AE, Oyetunji E, Ogunwolu L, Oke SA (2007) Job scheduling in a small scale gari processing firm in Nigeria. Pac J Sci Technol 8(1):137–143

    Google Scholar 

  • Rajakumar S, Arunachalam VP, Selladura V (2004) Workflow balancing strategies in parallel machine scheduling. Int J Adv Manuf Technol 23:366–374

    Article  Google Scholar 

  • Jarvis WJ (1980) Maintenance planning and scheduling in petrochemical manufacturing environment. National Petroleum Refineries Association, Washington DC 80(2):1–12

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. O. Odior.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Odior, A.O. Job scheduling in a yam flour producing company in Benin City. Int J Syst Assur Eng Manag 4, 397–403 (2013). https://doi.org/10.1007/s13198-012-0130-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-012-0130-9

Keywords

Navigation