Start Submission Become a Reviewer

Reading: SAI method for solving job shop sequencing problem under certain and uncertain environment

Download

A- A+
Alt. Display

Articles

SAI method for solving job shop sequencing problem under certain and uncertain environment

Authors:

Srikant Gupta ,

BGSB University, Rajouri, Jammu & Kashmir, IN
About Srikant
Department of Mathematical Sciences
X close

ather aziz raina,

Aligarh Muslim University, Aligarh, IN
About ather aziz
Department of Statistics & Operations Research
X close

Irfan Ali,

BGSB University, Rajouri, Jammu & Kashmir, IN
About Irfan
Department of Mathematical Sciences
X close

Aquil Ahmed

BGSB University, Rajouri, Jammu & Kashmir, IN
About Aquil
Department of Mathematical Sciences
X close

Abstract

In this investigation, we use SAI method (Gupta et al. 2016), for solving sequencing problem when processing time of the machine is certain or uncertain in nature. The procedure adopted for solving the sequencing problems is easiest and involves the minimum numbers of iterations to obtain the sequence of jobs. The uncertainty in data is represented by triangular or trapezoidal fuzzy numbers. Yager’s ranking function approach is used to convert these fuzzy numbers into a crisp at a prescribed value of α. Stepwise SAI method is then used to obtain optimal job sequence for the problem. Further, the result obtained by SAI method is compared with Johnson’s Method. Numerical examples are given to demonstrate the effectiveness of the proposed approach.
How to Cite: Gupta, S., raina, . ather . aziz ., Ali, I. and Ahmed, A., 2017. SAI method for solving job shop sequencing problem under certain and uncertain environment. Sri Lankan Journal of Applied Statistics, 18(3), pp.166–184. DOI: http://doi.org/10.4038/sljastats.v18i3.7911
Published on 31 Dec 2017.
Peer Reviewed

Downloads

  • PDF (EN)

    comments powered by Disqus