Minimizing Rental Cost for n-Jobs, 2-Machines Flow Shop Scheduling, Processing Time Associated with Probabilities Including Transportation Time and Job Block criteria

Sameer Sharma

Abstract


This paper deals with a heuristic algorithm to minimize the rental cost of the machines for two stage flow shop scheduling problem under specified rental policy in which processing times are associated with their respective probabilities. Further, the transportation time from one machine to another machine and an equivalent job block criteria is being considered. The purposed algorithm is easy to understand and provide an important tool for the decision makers. A computer program followed by a numerical illustration is also given to justify the algorithm.

Keywords: Equivalent job, Flow Shop, Rental Policy, Transportation Time, Elapsed Time.


Full Text: PDF

Refbacks

  • There are currently no refbacks.
Download the IISTE publication guideline!

Paper submission email: IKM@iiste.org

ISSN (Paper)2224-5758 ISSN (Online)2224-896X

Please add our address "contact@iiste.org" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright © www.iiste.org