A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block | Zendy

Deepak Gupta | Zendy; Sameer Sharma | Zendy; Shefali Aggarwal | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block

Author(s) -

Deepak Gupta,

Sameer Sharma,

Shefali Aggarwal

Publication year - 2012

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/6375-8836

Subject(s) - computer science , disjoint sets , string (physics) , production (economics) , block (permutation group theory) , schedule , flow (mathematics) , operations research , stage (stratigraphy) , flow shop scheduling , industrial engineering , mathematical optimization , job shop scheduling , mathematics , discrete mathematics , microeconomics , combinatorics , operating system , geometry , economics , paleontology , engineering , mathematical physics , biology

The aim of this paper is to introduce the concept of disjoint job blocks in n-jobs, three machines flow shop scheduling problem to minimize the total elapsed time and rental cost of the machines under a specified rental policy in which the processing time associated with probabilities including transportation time. A heuristic approach for flow shop with a computational algorithm to find optimal or near optimal solution is described. A computer program followed by a numerical illustration is given to justify the proposed algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research