Minimization of Utilization Time for Specially Structured n × 3 Scheduling Model with Jobs in a String of Disjoint Job Blocks
Pradeep Bishnoi1, Deepak Gupta2, Shashi Bala3
1Maharishi Markandeshwaar (Deemed to be University), Mullana, Ambala, India.
2Dr. Deepak Gupta, Professor and Head, Department of Mathematics, Maharishi Markandeshwar (Deemed to be University), Mullana, Ambala, India.
3Dr. Shashi Bala, Associate Professor, Department of Mathematics, Maharana Pratap College (Women), Mandi Dabwali, Sirsa, India.
Manuscript received on September 17, 2019. | Revised Manuscript received on 27 September, 2019. | Manuscript published on October 10, 2019. | PP: 3554-3558 | Volume-8 Issue-12, October 2019. | Retrieval Number: L26291081219/2019©BEIESP | DOI: 10.35940/ijitee.L2629.1081219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The present paper investigates n×3 specially structured flow shop scheduling model with processing of jobs on given machines in a string of disjoint job blocks and with probabilities associated to the processing times of jobs. The objective is to minimize utilization time of second and third machine and also minimize the total elapsed time for processing the jobs for n×3 specially structured flow shop scheduling problem. The algorithm developed in this paper is quite straightforward and easy to understand and also present an essential way out to the decision maker for attaining an optimal sequence of jobs. The algorithm developed in this paper is validated by a numerical illustration.
Keywords: Disjoint Job Blocks, Elapsed Time, Jobs in a String, Specially Structured Flow Shop Scheduling, Utilization Time.
Scope of the Article: Cloud Resources Utilization in IoT