Critical Study of Flow Shop Scheduling

Abstract

Flow-shop scheduling is an optimization problem. It is a form of optimal job scheduling. In a basic job-scheduling problem, n jobs J1, J2,, Jn are given, each with a different processing time. These jobs must be scheduled on m machines, each with a different processing power, while attempting to reduce the makespan, or the overall length of the schedule (that is, when all the jobs have finished processing). Each task in the particular variation known as flow-shop scheduling has exactly m operations. The i-th machine must carry out the i-th operation of the job. No machine can carry out more than one task at once. Execution time is given for each job's operation. This paper reflects critical study of Flow Shop Scheduling .