A Flexible Job Shop Scheduling Problem Involving Reconfigurable Machine Tools Under Industry 5.0

• URL: http://arxiv.org/abs/2410.23302v1
• Date: Wed, 16 Oct 2024 11:40:06 GMT
• Title: A Flexible Job Shop Scheduling Problem Involving Reconfigurable Machine Tools Under Industry 5.0
• Authors: Hessam Bakhshi-Khaniki, Reza Tavakkoli-Moghaddam, Zdenek Hanzalek, Behdin Vahedi-Nouri,
• Abstract summary: The flexible job shop scheduling problem (FJSSP) accurately reflects the complexities of modern manufacturing settings. This paper investigates the FJSSP involving reconfigurable machine tools with configuration dependent setup times. A mixed-integer programming (MIP) model is developed to simultaneously optimize these objectives.
• Score: 5.7522869823664005
• License:
• Abstract: The rise of Industry 5.0 has introduced new demands for manufacturing companies, requiring a shift in how production schedules are managed to address human centered, environmental, and economic goals comprehensively. The flexible job shop scheduling problem (FJSSP), which involves processing operations on various capable machines, accurately reflects the complexities of modern manufacturing settings. This paper investigates the FJSSP involving reconfigurable machine tools with configuration dependent setup times, while integrating human aspects like worker assignments, moving time, and rest periods, as well as minimizing total energy consumption. A mixed-integer programming (MIP) model is developed to simultaneously optimize these objectives. The model determines the assignment of operations to machines, workers, and configurations while sequencing operations, scheduling worker movements, and respecting rest periods, and minimizing overall energy consumption. Given the NPhard nature of the FJSSP with worker assignments and reconfigurable tools, a memetic algorithm (MA) is proposed. This metaheuristic evolutionary algorithm features a three layer chromosome encoding method, specialized crossover and mutation strategies, and neighborhood search mechanisms to enhance solution quality and diversity. Comparisons of MA with MIP and genetic algorithms (GA) on benchmark instances demonstrate the MA efficiency and effectiveness, particularly for larger problem instances where MIP becomes impractical. This research paves the way for sustainable and resilient production schedules tailored for the factory of the future under the Industry 5.0 paradigm. The work bridges a crucial gap in current literature by integrating worker and environmental impact into the FJSSP with reconfigurable machine models.

Related papers

• Optimizing Job Shop Scheduling in the Furniture Industry: A Reinforcement Learning Approach Considering Machine Setup, Batch Variability, and Intralogistics [0.0]
  This paper explores the potential application of Deep Reinforcement Learning in the furniture industry. A concept for a model is proposed that provides a higher level of information detail to enhance scheduling accuracy and efficiency. The model extends traditional approaches to JSSPs by including job volumes, buffer management, transportation times, and machine setup times.
  arXiv  Detail & Related papers  (2024-09-18T09:12:40Z)
• Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search [84.39855372157616]
  This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations. We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation. In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-08-29T20:22:22Z)
• The Practimum-Optimum Algorithm for Manufacturing Scheduling: A Paradigm Shift Leading to Breakthroughs in Scale and Performance [0.0]
  The Practimum-Optimum (P-O) algorithm represents a paradigm shift in developing automatic optimization products. By computerizing them into algorithms, P-O generates many valid schedules at far higher speeds than human schedulers are capable of. The P-O algorithm is at the heart of Plataine Scheduler that, in one click, routinely schedules 30,000-50,000 tasks for real-life complex manufacturing operations.
  arXiv  Detail & Related papers  (2024-08-19T14:32:21Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling [3.0477617036157136]
  This paper addresses a production scheduling problem derived from an industrial use case. It focuses on unrelated parallel machine scheduling with the personnel availability constraint. It assumes shared personnel among machines, with one personnel required per machine for setup and supervision during job processing.
  arXiv  Detail & Related papers  (2024-02-24T01:04:04Z)
• Machine Learning Insides OptVerse AI Solver: Design Principles and Applications [74.67495900436728]
  We present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI solver. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. We detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance.
  arXiv  Detail & Related papers  (2024-01-11T15:02:15Z)
• A Comparative Study of Machine Learning Algorithms for Anomaly Detection in Industrial Environments: Performance and Environmental Impact [62.997667081978825]
  This study seeks to address the demands of high-performance machine learning models with environmental sustainability. Traditional machine learning algorithms, such as Decision Trees and Random Forests, demonstrate robust efficiency and performance. However, superior outcomes were obtained with optimised configurations, albeit with a commensurate increase in resource consumption.
  arXiv  Detail & Related papers  (2023-07-01T15:18:00Z)
• Flexible Job Shop Scheduling via Dual Attention Network Based Reinforcement Learning [73.19312285906891]
  In flexible job shop scheduling problem (FJSP), operations can be processed on multiple machines, leading to intricate relationships between operations and machines. Recent works have employed deep reinforcement learning (DRL) to learn priority dispatching rules (PDRs) for solving FJSP. This paper presents a novel end-to-end learning framework that weds the merits of self-attention models for deep feature extraction and DRL for scalable decision-making.
  arXiv  Detail & Related papers  (2023-05-09T01:35:48Z)
• Partitioning Distributed Compute Jobs with Reinforcement Learning and Graph Neural Networks [58.720142291102135]
  Large-scale machine learning models are bringing advances to a broad range of fields. Many of these models are too large to be trained on a single machine, and must be distributed across multiple devices. We show that maximum parallelisation is sub-optimal in relation to user-critical metrics such as throughput and blocking rate.
  arXiv  Detail & Related papers  (2023-01-31T17:41:07Z)
• A Memetic Algorithm with Reinforcement Learning for Sociotechnical Production Scheduling [0.0]
  This article presents a memetic algorithm with applying deep reinforcement learning (DRL) to flexible job shop scheduling problems (DRC-FJSSP) From research projects in industry, we recognize the need to consider flexible machines, flexible human workers, worker capabilities, setup and processing operations, material arrival times, complex job paths with parallel tasks for bill of material manufacturing, sequence-dependent setup times and (partially) automated tasks in human-machine-collaboration.
  arXiv  Detail & Related papers  (2022-12-21T11:24:32Z)
• Hybrid Manufacturing Process Planning for Arbitrary Part and Tool Shapes [0.0]
  We present a framework for identifying AM/SM actions that make up an HM process plan based on accessibility and support requirements. We define the actions to allow for temporary excessive material deposition or removal, with an understanding that subsequent actions can correct for them. We use this framework to generate a space of valid, potentially non-monotonic, process plans for a given part of arbitrary shape.
  arXiv  Detail & Related papers  (2022-05-24T06:01:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.