An Optimization Model for Smart and Sustainable Distributed Permutation Flow Shop Scheduling

被引:1
|
作者
Fathollahi-Fard, Amir M. [1 ]
Woodward, Lyne [1 ]
Akhrif, Ouassima [1 ]
机构
[1] Univ Quebec, Dept Elect Engn, Ecole Technol Super, 1100 Notre Dame St W, Montreal, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Smart Production; Sustainbale Production; Distributed Permutation Flow Shop; Optimization; ALGORITHM; MAKESPAN;
D O I
10.1016/j.procs.2024.01.003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Smart production scheduling has gained significant attention due to advancements in industrial informatics and technologies that enable the monitoring, control, and adaptation of task scheduling in response to disruptive events. These events can include machine breakdowns, variations in task processing times, and the arrival of new or unexpected tasks. Concurrently, sustainable production scheduling aims to optimize task scheduling by considering economic, environmental, and social factors. This paper introduces a novel optimization model for the development of smart and sustainable production scheduling in a distributed permutation flow shop. The proposed model aims to minimize the makespan while simultaneously limiting the number of lost working days and energy consumption. It also strives to increase job opportunities within acceptable limits. To evaluate the proposed model, we conduct numerical simulations using various examples and a real-case study focusing on auto workpiece production. The results demonstrate the superior performance of the proposed model. Sensitivity analyses are performed to assess the model's ability to deal with disruptions and uncertainties while satisfying economic, environmental, and social considerations. (C) 2024 The Authors. Published by Elsevier B.V.
引用
收藏
页码:21 / 31
页数:11
相关论文
共 50 条
  • [1] A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem
    Fathollahi-Fard, Amir M.
    Woodward, Lyne
    Akhrif, Ouassima
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [2] Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept
    Fathollahi-Fard, Amir M.
    Woodward, Lyne
    Akhrif, Ouassima
    JOURNAL OF INDUSTRIAL INFORMATION INTEGRATION, 2021, 24
  • [3] A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem
    Kouki, Samia
    Ladhari, Talel
    Jemni, Mohamed
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 2, PROCEEDINGS, 2010, 6082 : 328 - +
  • [4] Hybrid particle swarm optimization for permutation flow shop scheduling
    Liu, Zhixiong
    Wang, Shaomei
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3245 - +
  • [5] Distributed Permutation Flow Shop Scheduling Problem with Worker flexibility: Review, trends and model proposition
    Mraihi, Tasnim
    Driss, Olfa Belkahla
    EL-Haouzi, Hind Bril
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
  • [6] Multi-objective Optimization of the Distributed Permutation Flow Shop Scheduling Problem with Transportation and Eligibility Constraints
    Cai S.
    Yang K.
    Liu K.
    Journal of the Operations Research Society of China, 2018, 6 (3) : 391 - 416
  • [7] A New Robust Scheduling Model for Permutation Flow Shop Problem
    Liao, Wenzhu
    Fu, Yanxiang
    RECENT ADVANCES IN INTELLIGENT MANUFACTURING, PT I, 2018, 923 : 308 - 317
  • [8] Permutation Flow Shop Scheduling: Fuzzy Particle Swarm Optimization Approach
    Ling, Sai Ho
    Jiang, Frank
    Nguyen, Hung T.
    Chan, Kit Yan
    IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ 2011), 2011, : 572 - 578
  • [9] Ant colony optimization based algorithm for permutation flow shop scheduling
    Liu, Yan-Feng
    Liu, San-Yang
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2008, 30 (09): : 1690 - 1692
  • [10] Permutation Flow Shop Scheduling Optimization Method Based on Cooperative Games
    Zhang, Tingyi
    Guo, Xiaopeng
    Ji, Guojun
    IEEE ACCESS, 2023, 11 : 47377 - 47389