Optimal Three Stage Flow Shop Scheduling in which Processing Time, Set Up Time, Each Associated With Probabilities Including Transportation Time and Jobs in a String of Disjoint Job-Blocks

Sameer Sharma


The paper deals with n jobs, 3 machines flow shop production scheduling in which processing times and set up times are associated with their respective probabilities involving transportation time and jobs are processed in two disjoint job blocks in a string. A heuristic method with an objective to minimize the total time elapsed time/idle time of the jobs/machines is discussed. A computer program followed by numerical illustration is given to clarify the algorithm.

Keywords: Disjoint job-block, Set up time, Processing time, Transportation time, Equivalent job

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email: JNSR@iiste.org

ISSN (Paper)2224-3186 ISSN (Online)2225-0921

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