A String of Disjoint Job Block in Two Stage Open Shop Model in Fuzzy Environment

  IJMTT-book-cover
 
International Journal of Mathematics Trends and Technology (IJMTT)
 
© 2022 by IJMTT Journal
Volume-68 Issue-8
Year of Publication : 2022
Authors : Jatinder Pal Kaur, Deepak Gupta, Adesh kumar Tripathi, Renuka
 10.14445/22315373/IJMTT-V68I8P504

How to Cite?

Jatinder Pal Kaur, Deepak Gupta, Adesh kumar Tripathi, Renuka, "A String of Disjoint Job Block in Two Stage Open Shop Model in Fuzzy Environment," International Journal of Mathematics Trends and Technology, vol. 68, no. 8, pp. 32-38, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I8P504

Abstract
This paper deals with two stage open shop scheduling in which processing time is considered in triangular fuzzy number. The concept of a string of disjoint job blocks in which two distinct job blocks in such a way that first block covers the jobs with fixed route and the second block contains the jobs with arbitrary route is taken into consideration. The objective of the study is to attain an optimal or near optimal schedule through a heuristic approach to minimize the total elapsed time. A numerical illustration is given to justify the proposed algorithm.

Keywords : Scheduling, Open Shop, Job Block, String of job block.

Reference

[1] Johnson, S.M., “Optimal Two and Three Stage Production Schedule with Setup Time Included”, Naval Research Logistic Quarterly, vol.1, no.1, pp.61 – 68,1954.
[2] Smith, R.D., and Dudek, R.A., “A General Algorithm for Solution of and N-Jobs, M-Machines Sequencing Problem of and Flow-Shop”, Operations Research, vol.15, no.1, pp.71 – 82, 1967.
[3] Gupta, J.N.D., “Optimal Schedule for Specially Structured Flow Shop”, Naval Research Logistic, vol.22, no.2, pp.255 – 269,1975.
[4] Gonzalez,T. and Sahni,S., “Open Shop Scheduling To Minimize Finish Time”, Journal of and Association for Computing Machinery, vol. 23, no. 4, pp.665-679, 1976.
[5] Maggu, P.L and Das G., “Equivalent Jobs for Job Block in Job Sequencing”, Opsearch, vol.14, no.4, pp.277-281,1977.
[6] Dannenbring, D.G, “An Evaluation of Flow Shop Sequencing Heuristics, Management Science”, vol.23, no.11, pp.1174–1182, 1977.
[7] Yoshida and Hitomi, “Optimal Two Stage Production Scheduling with Set Up Times Separated”, AIIE Transactions, vol.11, no.3, pp.261 – 269, 1979.
[8] Miyazaki, S., and Nishiyama, N, “Analysis for Minimizing Weighted Mean Flow Time in Flow Shop Scheduling”, Journal of Operation Research Society of Japan, vol. 23, pp.118 – 132, 1980.
[9] Maggu, P.L., and Das, G., 1982, “Elements of Advanced Production Scheduling”, United Publishers and Periodical Distribution, Edition, 1985.
[10] Singh, T.P, “on N*2 Open Shop Problem Involving Job Block, Transportation Time and Break Down Machine Times”, PAMS, vol.21, pp.12, 1985.
[11] Harbans Lal and Maggu.P.L., “On Job Block Open Shop Scheduling Problem”, PAMS, vol.29, pp.45-51,1989.
[12] V.A.Strusevich, “A Heuristic for and Two–Machine Open Shop Scheduling Problem with Transportation Times”, Discrete Applied Mathematics vol.93, pp.287-304, 1999.
[13] Anup, “on Two Machine Flow Shop Problem in Which Processing Time Assume Probabilities and There Exists Equivalent for an Ordered Job Block”, JISSO, vol.23, no.1-4, pp.41-44, 2002.
[14] Heydari, “on Flow Shop Scheduling Problem with Processing of Jobs in a String of Disjoint Blocks: Fixed Order Jobs and Arbitrary Order Jobs”, JISSOR, vol.24, pp.449-454, 2003.
[15] Gupta Deepak & Singh.T.P., “Optimal Two Stage Production Schedule with Group Job -Restrictions Having Set Up Times Separated From Processing Time, Associated with Probabilities”, Des ERA JMS, vol.1, pp.53-70, 2004.
[16] Gupta Deepak, Singh T.P Et.Al, “on Job Block Open Shop Scheduling, and Processing Time Associated with Probability”, J. Indian Soc. Stat. Opers. Res. vol.26, no.1-4, pp. 91-96, 2005.
[17] Ahmad Pour Darvish Heydari, “on Flow Shop Scheduling Problem with Processing of Jobs in a String of Disjoint Job Blocks: Fixed Order Jobs and Arbitrary Order Jobs”, JISSOR, vol. 24, pp.39- 43.
[18] Singh, T.P., Kumar, V., and Gupta, D., “N×2 Flow-Shop Scheduling Problem in Which Processing Time, Set Up Time Each Associated with Probabilities Along with Jobs in a String of Disjoint Job Block”, Journal of Mathematical Science, Reflection Des ERA, vol.1, pp. 11 – 20, 2006.
[19] Gupta, D., Sharma S. and Gulati, N., “N×3 Flow Shop Production in Schedule, Processing Time, Setup Time Each Associated with Probabilities Along with Jobs String of Disjoint Job-Blocks”, Antartica Journal of Mathematics, vol.8, no.5, pp.443 – 457, 2011.
[20] Gupta, D., Sharma, S., Gulati, N. and Singh, H., “Idle / Waiting Time Operator Oi, of an Equivalent Job for A Job Block Criterion To Minimize and Rental Cost in Two Stage Flow Shop Scheduling, and Processing Time Associated with Probabilities”, Innovative Systems Design and Engineering, vol. 2, no.4, pp.186-206, 2011.
[21] Gupta, D, Bala, S. and Bishnoi, P., “on Specially Structured Two Stage Flow Shop Scheduling Problem with Jobs in a String of Disjoint Job Blocks”, Advances in Applied Science Research, vol.7, no.4, pp.190-196, 2016.