← Back to VOLUME 11, ISSUE 6, JUNE 2024
This work is licensed under a Creative Commons Attribution 4.0 International License.
On optimizing the flow shop scheduling with probabilistic processing time for waiting time of jobs
👁 1 view📥 0 downloads
Abstract: The present paper deals with the Flow Shop Scheduling (FSS) models with special structures. The algorithm to optimize the waiting time of jobs has been proposed. The main goal of the study is to achieve a sequence of jobs that provides the minimum total waiting time of jobs. The numerical example has been solved to present the algorithm structure.
Keywords: Waiting time of jobs, Flow shop, Scheduling, Processing time.
How to Cite:
[1] Bharat Goyal, “On optimizing the flow shop scheduling with probabilistic processing time for waiting time of jobs,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2024.11675
This work is licensed under a Creative Commons Attribution 4.0 International License.