Mathematics and Statistics Vol. 10(5), pp. 909 - 917
DOI: 10.13189/ms.2022.100502
Reprint (PDF) (505Kb)

A String of Disjoint Job Block with Processing Time Associated with Probability in Two-Stage Weighted Open Shop Model

Jatinder Pal Kaur ^*, Deepak Gupta , Adesh kumar Tripathi , Renuka
Department of Mathematics, Maharishi Markandeshwar (Deemed to be University), Mullana, Ambala, India

ABSTRACT

Open-shop scheduling problem (OSSP) is a well-known topic with wide industrial applications which belongs to one of the vital issues in the field of engineering. This paper deals with a two-stage open shop scheduling problem in which the processing time of jobs is allied with probabilities. The concept of a string of two job blocks which are disjoint in nature is considered so that the first block covers the jobs with a fixed route and the second block covers the jobs with an arbitrary path. Further, the weights of jobs are also introduced due to their applicability and relative importance in the real world. The objective of this study is to propose a heuristic which on execution, provides an optimal or near-optimal schedule to diminish the makespan. Several numerical illustrations are produced in MATLAB 2018a to demonstrate the effectiveness of the proposed approach, and to confirm the performance, the results are compared with the existing methods developed by Johnson and Palmer.

KEYWORDS
Scheduling, Open Shop, Job Block, Weights of Jobs, Flow Shop

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Jatinder Pal Kaur , Deepak Gupta , Adesh kumar Tripathi , Renuka , "A String of Disjoint Job Block with Processing Time Associated with Probability in Two-Stage Weighted Open Shop Model," Mathematics and Statistics, Vol. 10, No. 5, pp. 909 - 917, 2022. DOI: 10.13189/ms.2022.100502.

(b). APA Format:
Jatinder Pal Kaur , Deepak Gupta , Adesh kumar Tripathi , Renuka (2022). A String of Disjoint Job Block with Processing Time Associated with Probability in Two-Stage Weighted Open Shop Model. Mathematics and Statistics, 10(5), 909 - 917. DOI: 10.13189/ms.2022.100502.