Sequencing with restrictions in processing times

Sequencing with restrictions in processing times

0.00 Avg rating—0 Votes
Article ID: iaor19981679
Country: India
Volume: 34
Issue: 2
Start Page Number: 116
End Page Number: 127
Publication Date: Jun 1997
Journal: OPSEARCH
Authors: ,
Abstract:

Johson and Szwarc gave the algorithm for obtaining the sequence which minimizes the total elapsed time for n-jobs–3 machines problem when the processing times of jobs on these machines possess certain conditions. This paper yields the algorithm for general flow shop problems.

Reviews

Required fields are marked *. Your email address will not be published.