INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
Flow shop scheduling problem to reduce the makespan with transporting agent and loading - unloading time
Authors Name:
SAYALI DIPAK CHOUDHARI
, Dr. Ritu Khanna
Unique Id:
IJSDR1706032
Published In:
Volume 2 Issue 6, June-2017
Abstract:
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.
Keywords:
Flow-shop scheduling, Johnson’s rule, loading time, unloading time, transporting time.
Cite Article:
"Flow shop scheduling problem to reduce the makespan with transporting agent and loading - unloading time ", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.2, Issue 6, page no.230 - 240, June-2017, Available :http://www.ijsdr.org/papers/IJSDR1706032.pdf
Downloads:
000337072
Publication Details:
Published Paper ID: IJSDR1706032
Registration ID:170492
Published In: Volume 2 Issue 6, June-2017
DOI (Digital Object Identifier):
Page No: 230 - 240
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn