alexa Abstract | On Specially Structured Two Stage Flow Shop Scheduling Problem with Jobs In A String of Disjoint Job Blocks

Advances in Applied Science Research
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


The present paper studies two stage specially structured flow shop scheduling problem with jobs in a string of disjoint job blocks in which processing times are associated with their respective probabilities, where the optimization criteria is the utilization time of machines. The objective is to minimize utilization time of machines for two the stage specially structured flow shop scheduling problem with jobs in a string of disjoint job blocks. The algorithm proposed in this paper is very simple and easy to understand and also provide an important tool for the decision maker. The algorithm is justified by a numerical illustration.

To read the full article Peer-reviewed Article PDF image

Author(s): Deepak Gupta Shashi Bala and Pradeep Bishnoi


Utilization Time, Specially Structured Flow Shop Scheduling, Processing time, Equivalent job, Jobs in a String, Disjoint Job Blocks, Elapsed Time., Utilization Time

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