Johnson, Szwarc gave the algorithm for obtaining the sequence which minimizes the total elapsed time for n-jobs-3 machines problem when the processing time of jobs on these machines possess certain conditions. This paper yields the... more
Johnson, Szwarc gave the algorithm for obtaining the sequence which minimizes the total elapsed time for n-jobs-3 machines problem when the processing time of jobs on these machines possess certain conditions. This paper yields the algorithm for general flow shop problems.
Research Interests:
This Paper attempts to obtain a sequence which minimizes mean completion time of jobs for general flowshop problem when processing time of jobs on various machines follow certain conditions.