The paper deals with n´2 open shop scheduling problem in which the processing time of jobs on machines, transportation time of each job from one machine to another and weightage to jobs is considered. The objective of the study is to find an optimal sequence of jobs which minimizes total weighted mean production time. The algorithm is derived to find out the optimal sequence and is demonstrated with numerical illustration.
Copy the following to cite this article:
I. Vij; S. Mittal; T. Singh, "Optimal flow time in open shop scheduling including weights and transportation time ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 566-570, 2018Copy the following to cite this URL:
I. Vij; S. Mittal; T. Singh, "Optimal flow time in open shop scheduling including weights and transportation time ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 566-570, 2018Available from: https://www.ultrascientist.org/paper/1224/