Article Sidebar
Published:
Jun 30, 2017DOI:
10.4314/njt.v36i3.21Keywords:
Article Details
Copyright belongs to the Faculty of Engineering, University of Nigeria, Nsukka, Nigeria
The contents of the articles are the sole opinion of the author(s) and not of NIJOTECH.
NIJOTECH allows open access for distribution of the published articles in any media so long as whole (not part) of articles are distributed.
A copyright and statement of originality documents will need to be filled out clearly and signed prior to publication of an accepted article. The Copyright form can be downloaded from https://www.nijotech.com/downloads/COPYRIGHT%20FORM.pdf while the Statement of Originality is in Statement of Originality.pdf (nijotech.com)
For articles that were developed from funded research, a clear acknowledgement of such support should be mentioned in the article with relevant references. Authors are expected to provide complete information on the sponsorship and intellectual property rights of the article together with all exceptions.
It is forbidden to publish the same research report in more than one journal.
Main Article Content
MODELING, OPTIMISATION AND ANALYSIS OF RE-ENTRANT FLOWSHOP JOB SCHEDULING WITH FUZZY PROCESSING TIMES
Abstract
This paper presents a makespan minimization of -jobs -machines re-entrant flow shop scheduling problem (RFSP) under fuzzy uncertainties using Genetic Algorithm. The RFSP objective is formulated as a mathematical programme constrained by number of jobs and resources availability with traditional scheduling policies of First Come First Serve (FCFS) and the First Buffer First Serve (FBFS). Jobs processing times were specified by fuzzy numbers and modelled using triangular membership function representations. The modified centroid defuzzification technique was used at different alpha-cuts to obtain fuzzy processing times (FPT) of jobs to explore the importance of uncertainty. The traditional GA schemes and operators were used together with roulette wheel algorithm without elitism in the selection process based on job fuzzy completion times. A test problem of five jobs with specified Job Processing and Transit Times between service centres, Job Start Times and Job Due times was posed. Results obtained using the deterministic and fuzzy processing times were compared for the two different scheduling policies, FCFS and FBFS. The deterministic optimal makespan for FBFS schedule was 61.2% in excess of the FCFS policy schedule. Â The results also show that schedules with fuzzy uncertainty processing times provides shorter makespans than those for deterministic processing times and those under FCFS performing better than those under FBFS policy for early jobs while on the long run the FBFS policy performs better. The results underscore the need to take account of comprehensive fuzzy uncertainties in job processing times as a trade-off between time and costs influenced by production makespan.
Â
