alexa Optimal Two Stage Flow Shop Scheduling Problem with Branch and Bound Method Including Transportation Time | Abstract
ISSN ONLINE(2320-9801) PRINT (2320-9798)

International Journal of Innovative Research in Computer and Communication Engineering
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article Open Access

Abstract

This paper studies two stage flow shop scheduling problem in which processing times are associated with their respective probabilities and transportation times from one machine to another are given. The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved with branch and bound method. The method is illustrated by numerical example.

To read the full article Peer-reviewed Article PDF image | Peer-reviewed Full Article image

Author(s): Deepak Gupta Payal Singla Shashi Bala

Share This Page

Additional Info

Loading
Loading Please wait..
 
 
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords