Flow shop scheduling problems with rudimentary criteria of minimum makespan are the most important investigated problems in the field of scheduling. Generally during the process of generating an optimal sequence, multiple partial sequences claiming the optimal value of makespan are observed. In this paper a novel tie-breaking rule to select one of the best optimal sequences out of all possible partial sequences is developed which then applied to Nawaz-Enscore-Ham (NEH) heuristic to solve the scheduling problems in permutation flowshop without increasing the computational complexity. The performance of proposed heuristic is tested with other existing tie-breaking heuristics of similar complexity over Taillard and VRF's instances. Computational results reveal that in terms of solution quality, the proposed heuristic outperforms over the other NEH based heuristics of the same complexity reported in literature.

No abstract

No abstract

In the present paper an overview has been demonstrated, on recent developments in the literature of sequencing and scheduling. These strategies are very useful in the academic literature and very important tools in the area of operational research. Sequencing has given a remarkable attention in research since the improvement of academic publications. In this paper, various tools and techniques of sequencing, has been studied that are used in the scheduling of process. Scheduling comes in branch of mathematical modeling in which the problems are pre defined, and there are common characteristics that are translated into similar types of constraints. Here various categories of scheduling and sequencing models are identified. Directions for future research are also provided in present paper scenario along with objective of creating bridge between theory and practical use of different types of sequencing and scheduling in the field of operations research.

No abstract