700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis 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
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