n X 2 Flow Shop Scheduling

The book covers up the basic concepts of Operations research and scheduling theory and focuses on 'n' job '2' machine Flow Shop Scheduling, where the times to process the jobs are not at the whole arbitrary but have a definite relation with one another. It is assumed the minimum of the times to process the jobs on second machine can never be less than the maximum of the times to process the jobs on the first machine. The main intention of the study is to lessen the total of the times spent in waiting by all the jobs.

Autorentext

Dr. Deepak Gupta, Professor and Head, Department of Mathematics, Maharishi Markandeshwar (Deemed to be University), Mullana, Haryana, India has more than 200 research papers and 20 books to his credit.Dr. Bharat Goyal, Department of Mathematics, Khalsa College, Patiala, Punjab, India has more than 6 years of experience in teaching mathematics.