Flow shop scheduling problem to reduce the makespan with transporting agent and loading - unloading time
SAYALI DIPAK CHOUDHARI
, Dr. Ritu Khanna
Flow-shop scheduling, Johnson’s rule, loading time, unloading time, transporting time.
Abstract In flow shop scheduling problem n-number of jobs are processed through m- number of machines to achieve the required objectives like minimizing make-span, reducing cost, meeting the due date etc. The main objectives of this flow shop problem are minimization of make-span and total flow time of jobs in process. In this paper we try to find the optimum solution for the problem of six machines arranged in series and jobs are assigned with weights. Transporting time, loading time and unloading time of the conveyor is considered separately. Johnson’s algorithm is applied for finding the optimum solution. Total makespan and minimum weighted flow time is calculated.
"Flow shop scheduling problem to reduce the makespan with transporting agent and loading - unloading time ", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 6, page no.230 - 240, June-2017, Available :https://ijsdr.org/papers/IJSDR1706032.pdf
Volume 2
Issue 6,
June-2017
Pages : 230 - 240
Paper Reg. ID: IJSDR_170492
Published Paper Id: IJSDR1706032
Downloads: 000347181
Research Area: Applied Mathematics
Country: PANVEL-NAVI MUMBAI, MAHARASHTRA, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
