%0 Journal Article
%T A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm
%A Adeyanju Sosimi
%A Folorunso Oladimeji Ogunwolu
%A Taoreed Adegbola
%J Journal of Industrial Engineering
%D 2014
%I Hindawi Publishing Corporation
%R 10.1155/2014/628640
%X An optimization scheme for minimizing makespan of Gari processing jobs using improved initial population Genetic Algorithm (GA) is proposed. GA with initial population improved by using job sequencing and dispatching rules of First Come First Served (FCFS), Shortest Processing Time (SPT), Longest Processing Time (LPT), and Modified Johnson¡¯s Algorithm for -machines in order to obtain better schedules than is affordable by GA with freely generated initial population and by individual traditional sequencing and dispatching rules was used. The traditional GA crossover and mutation operators as well as a custom-made remedial operator were used together with a hybrid of elitism and roulette wheel algorithms in the selection process based on job completion times. A test problem of 20 jobs with specified job processing and arrival times was simulated through the integral 5-process Gari production routine using the sequencing and dispatching rules, GA with freely generated initial population, and the improved GA. Comparisons based on performance measures such as optimal makespan, mean makespan, execution time, and solution improvement rate established the superiority of the improved initial population GA over the traditional sequencing and dispatching rules and freely generated initial population GA. 1. Introduction One of the most important products obtained from the processing of cassava is ¡°Gari.¡± Gari is a creamy-white, granular flour with a slightly fermented flavor and a slightly sour taste made from fermented, gelatinized fresh cassava tubers. Gari processing industries occupy a substantial portion of small and medium enterprises (SMEs) in Nigeria. In the past few decades, research on Gari production has yielded tremendous gain particularly in the areas of developing Gari processing machine and improving on its quality. However, little or no attention has been given to scheduling of customers¡¯ orders in a way that would improve delivery performance and inventory management and reduce production cycle times and overall cost associated with the production process. Hence, operational bottlenecks are often experienced in the day to day activities while the desire for appropriate processor becomes imperative. Job scheduling in a Gari processing firm is analogous to a flow shop in which a set of -jobs have to be processed with identical flow patterns on -machines. In their works [1¨C3] developed scheduling models on the following assumptions.(i)Each of the -jobs has the same ordering of machines for its process sequence.(ii)At a time, every job is processed on
%U http://www.hindawi.com/journals/jie/2014/628640/