On employing pythagorean fuzzy processing time to minimize machine rental cost

被引:1
|
作者
El-Morsy, Salwa [1 ,2 ]
Ahmad, Junaid [3 ]
George, Reny [4 ]
机构
[1] Qassim Univ, Coll Sci & Arts, Dept Math, Al Badaya 51951, Saudi Arabia
[2] Nile Higher Inst Engn & Technol, Basic Sci Dept, Mansoura, Egypt
[3] Int Islamic Univ, Dept Math & Stat, H-10, Islamabad 44000, Pakistan
[4] Prince Sattam Bin Abdulaziz Univ, Coll Sci & Humanities Al Kharj, Dept Math, Al Kharj 11942, Saudi Arabia
来源
AIMS MATHEMATICS | 2023年 / 8卷 / 07期
关键词
flow shop scheduling; pythagorean fuzzy numbers; fuzzy processing time; optimization problems; decision making;
D O I
10.3934/math.2023882
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The aim of this paper is to obtain the minimal rental cost of the three-phases flow shop scheduling problems. A novel strategy to tackle this issue using Pythagorean fuzzy processing time is introduced. It depends on converting the three stages machine into two stages when the minimum value of processing time of the first machine is greater than the maximum value of processing time of the second machine. The vague processing time does not convert to its crisp form. The jobs sequencing in machines is obtained using Johnson procedure. The zero element of the Pythagorean set is defined as, (O) over tilde (P) = (0,1) i.e., it has zero membership and one nonmembership values. A numerical example include Pythagorean rental cost is delivered to demonstrate the reliability of the suggested strategy. The idle time, utilization time, and the overall cost are calculated. The idle time of all machines is zero, which minimize the required time and hence, minimize the total rental cost.
引用
收藏
页码:17259 / 17271
页数:13
相关论文
共 50 条
  • [1] BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST
    STEINER, G
    TRUSCOTT, WG
    IIE TRANSACTIONS, 1993, 25 (05) : 90 - 97
  • [2] Using tool life models to minimize processing time on a flexible machine
    Lamond, BF
    Sodhi, MS
    IIE TRANSACTIONS, 1997, 29 (07) : 611 - 621
  • [3] One machine fuzzy scheduling to minimize total weighted tardiness, earliness, and recourse cost
    Dong, Yanwen
    International Journal of Smart Engineering System Design, 2003, 5 (03): : 135 - 147
  • [4] Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
    Yeh, Wei-Chang
    Lai, Peng-Jen
    Lee, Wen-Chiung
    Chuang, Mei-Chi
    INFORMATION SCIENCES, 2014, 269 : 142 - 158
  • [5] Scheduling a single continuous batch processing machine to minimize total completion time
    Zhao, Yu-Fang
    Tang, Li-Xin
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2008, 36 (02): : 367 - 370
  • [7] Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
    Gong, Hua
    Tang, Lixin
    Leung, Joseph Y. T.
    NAVAL RESEARCH LOGISTICS, 2016, 63 (06) : 492 - 502
  • [8] Single machine batch processing problem with release dates to minimize total completion time
    Beldar, Pedram
    Costa, Antonio
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 331 - 348
  • [9] Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs
    Laslo, Zohar
    Golenko-Ginzburg, Dimitri
    Keren, Baruch
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) : 812 - 821
  • [10] Parallel machine scheduling problem with machine cost to minimize the maximal lateness
    Li K.
    Xu S.
    Cheng B.
    Yang S.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2019, 39 (01): : 165 - 173