CERTIFICATE

IMPACT FACTOR 2021

Subject Area

  • Life Sciences / Biology
  • Architecture / Building Management
  • Asian Studies
  • Business & Management
  • Chemistry
  • Computer Science
  • Economics & Finance
  • Engineering / Acoustics
  • Environmental Science
  • Agricultural Sciences
  • Pharmaceutical Sciences
  • General Sciences
  • Materials Science
  • Mathematics
  • Medicine
  • Nanotechnology & Nanoscience
  • Nonlinear Science
  • Chaos & Dynamical Systems
  • Physics
  • Social Sciences & Humanities

Why Us? >>

  • Open Access
  • Peer Reviewed
  • Rapid Publication
  • Life time hosting
  • Free promotion service
  • Free indexing service
  • More citations
  • Search engine friendly

Specially structured n × 2 flow shop scheduling problem with jobs in a string of disjoint job blocks including transportation time

Author: 
Deepak Gupta, Shashi Bala and Pradeep Bishnoi
Subject Area: 
Physical Sciences and Engineering
Abstract: 

This paper provides a simple heuristic algorithm to minimize utilization time for specially structured n-job and 2-machine flow shop scheduling problem with jobs in a string of disjoint job blocks in which the processing times are associated with probabilities including transportation time. Usually in machine scheduling models it is assumed that the jobs are delivered instantaneously from one point to another without taking into account the transportation time involved therein. In this paper we study machine scheduling problems having jobs in a string of disjoint job blocks and by taking into account the explicit transportation considerations. Also, the processing times are not random but bear well defined relationship to one another. In flow shop scheduling the emphasis is on minimization of idle time/elapsed time but minimization of elapsed time may not always lead to minimization of utilization time. Here, the objective is to find an algorithm to minimize the utilization time of machines. The proposed algorithm is validated with the help of a numerical example.

PDF file: 

CALL FOR PAPERS

 

ONLINE PAYPAL PAYMENT

IJMCE RECOMMENDATION

Advantages of IJCR

  • Rapid Publishing
  • Professional publishing practices
  • Indexing in leading database
  • High level of citation
  • High Qualitiy reader base
  • High level author suport

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

 

EDITORIAL BOARD

CHUDE NKIRU PATRICIA
Nigeria
Dr. Swamy KRM
India
Dr. Abdul Hannan A.M.S
Saudi Arabia.
Luai Farhan Zghair
Iraq
Hasan Ali Abed Al-Zu’bi
Jordanian
Fredrick OJIJA
Tanzanian
Firuza M. Tursunkhodjaeva
Uzbekistan
Faraz Ahmed Farooqi
Saudi Arabia
Eric Randy Reyes Politud
Philippines
Elsadig Gasoom FadelAlla Elbashir
Sudan
Eapen, Asha Sarah
United State
Dr.Arun Kumar A
India
Dr. Zafar Iqbal
Pakistan
Dr. SHAHERA S.PATEL
India
Dr. Ruchika Khanna
India
Dr. Recep TAS
Turkey
Dr. Rasha Ali Eldeeb
Egypt
Dr. Pralhad Kanhaiyalal Rahangdale
India
DR. PATRICK D. CERNA
Philippines
Dr. Nicolas Padilla- Raygoza
Mexico
Dr. Mustafa Y. G. Younis
Libiya
Dr. Muhammad shoaib Ahmedani
Saudi Arabia
DR. MUHAMMAD ISMAIL MOHMAND
United State
DR. MAHESH SHIVAJI CHAVAN
India
DR. M. ARUNA
India
Dr. Lim Gee Nee
Malaysia
Dr. Jatinder Pal Singh Chawla
India
DR. IRAM BOKHARI
Pakistan
Dr. FARHAT NAZ RAHMAN
Pakistan
Dr. Devendra kumar Gupta
India
Dr. ASHWANI KUMAR DUBEY
India
Dr. Ali Seidi
Iran
Dr. Achmad Choerudin
Indonesia
Dr Ashok Kumar Verma
India
Thi Mong Diep NGUYEN
France
Dr. Muhammad Akram
Pakistan
Dr. Imran Azad
Oman
Dr. Meenakshi Malik
India
Aseel Hadi Hamzah
Iraq
Anam Bhatti
Malaysia
Md. Amir Hossain
Bangladesh
Ahmet İPEKÇİ
Turkey
Mirzadi Gohari
Iran