Heuristic Approach for n-Jobs, 3-Machines Flow Shop Scheduling Problem, Processing Time Associated With Probabilities Involving Transportation Time, Break-Down Interval, Weightage of Jobs and Job Block Criteria
No Thumbnail Available
Date
2011
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Mathematical Theory and Modeling Vol.1, No.1, 2011
Abstract
This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop scheduling
problem in which processing times are associated with their corresponding probabilities involving
transportation time, break down interval and job block criteria. Further jobs are attached with weights to
indicate their relative importance. A heuristic approach method to find optimal or near optimal sequence
minimizing the total elapsed time whenever mean weighted production flow time is taken into
consideration. The proposed method is very easy to understand and also provide an important tool for
decision makers. A numerical illustration is also given to clarify the algorithm