Shashi Bala
The present paper is an attempt to develop a heuristic algorithm for two machines specially structured open shop scheduling in which order of processing is not given (A → B or B → A). Further the processing time of jobs are associated with their probabilities under some well defined structural relationship to one another. The objective of the paper is to minimize the rental cost of machines under a specified rental policy. A numerical illustration is given to support the algorithm.
English 
Spanish 
Chinese 
Russian 
German 
French 
Portuguese 
Hindi