Flowshop sequencing problem with ordered processing time matrices: A general case

✍ Scribed by M. L. Smith; S. S. Panwalkar; R. A. Dudek

• Publisher: John Wiley and Sons
• Year: 1976
• Tongue: English
• Weight: 305 KB
• Volume: 23
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800230310

✦ Synopsis

Abstract

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.