Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs

Sathiya Shanthi R ,S Jayakumar ,R Meganathan ,R Vijayaragavan

doi:10.26524/cm102

Abstract

Scheduling process arises naturally upon availability of resources through a systematic approach in which prior planning and decisions should be made. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954 with makespan minimization as objective. Earlier we proposed two algorithms for the makespan objective; in this paper we intend to investigate the same algorithms for the objective of Total Completion Time of all the jobs (TCT). Experimental results had shown that one of our algorithms gives better results than the other two when the machine order is reversed.

Highlights

Scheduling is a decision making process as it decides the order in which the tasks are to be processed through the resources
The concept of flow shop scheduling problem (FSSP) was first introduced by S M Johnson [11] in the mid of 1954 which has became standard in the field of scheduling theory
In [6], we proposed a new algorithm for the 2 machine n jobs FSSP by proposing Algorithm A and compared our results with Johnson’s algorithm when the machine order is reversed

Summary

Introduction

Scheduling is a decision making process as it decides the order in which the tasks are to be processed through the resources. It plays a major role in the production planning and control which reflects on economic activities of many manufacturing industries and service sectors. FSSP occurs when all the jobs have been processed in the same order on all the available machines. It has a vital role in all the service sectors and manufacturing industries for which finding an optimum solution in a polynomial is always critical when the number of machines is increased. Minimization of makespan is more important objective for a scheduler while many works has been done on minimization of the total completion time of all the jobs

Literature review

Conclusion