Deepak Gupta, Shashi Bala and Pradeep Bishnoi
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.
English 
Spanish 
Chinese 
Russian 
German 
French 
Portuguese 
Hindi