Novel properties along with solution methods for permutation flowshop scheduling

This paper deals with permutation flow shop scheduling to minimize makespan. Some novel, useful definitions and properties are established. Then, the paper proposes novel solution methods. Particular attention is paid to algorithms based on the orderings of pairs of jobs. The first algorithm is for...

Full description

Saved in:
Bibliographic Details
Published inScientia Iranica. Transaction E, Industrial engineering Vol. 23; no. 5; p. 2261
Main Authors Aminnayeri, M, Naderi, B
Format Journal Article
LanguageEnglish
Published Tehran Sharif University of Technology 01.10.2016
Subjects
Industrial engineering
Job orders
Production scheduling
Scheduling algorithms
Online AccessGet full text

Cover

More Information
Summary:This paper deals with permutation flow shop scheduling to minimize makespan. Some novel, useful definitions and properties are established. Then, the paper proposes novel solution methods. Particular attention is paid to algorithms based on the orderings of pairs of jobs. The first algorithm is for three-machine problems; it gives an optimal solution in a certain strict sense in the case of the ordering of two jobs. Moreover, the paper extends the three-machine Johnson's rule to the general case of m-machine problems.