Abstract
The present paper is an attempt through heuristic method to obtain the optimal sequence for n jobs two stage open shop problem in which Set up time separated from processing times, each associated with respective probabilities.. The algorithm developed in this paper is very simple and easy to understand. A numerical illustration to clarify the algorithm is also given.
Issue
The Experiment 2013
Article Category:
Research Article
Article Subject:
Mathematics
KeyWords:
Open shop problem, Equivalent job, Elapsed time