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

Simple item page
dc.contributor.authorDeepak Gupta
dc.contributor.authorSamir Sharma
dc.contributor.authorSeema Sharma
dc.date.accessioned2026-02-14T05:46:41Z
dc.date.available2026-02-14T05:46:41Z
dc.date.issued2011
dc.description.abstractThis 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
dc.identifier.issnISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
dc.identifier.urihttp://davjalandhar.ndl.gov.in/handle/123456789/205
dc.language.isoen
dc.publisherMathematical Theory and Modeling Vol.1, No.1, 2011
dc.titleHeuristic 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
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Heuristic Approach for n-Jobs, 3-Machines Flow Shop.pdf
Size:
328.1 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Research Articles