Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)

• URL: http://arxiv.org/abs/2307.14799v3
• Date: Thu, 14 Sep 2023 13:45:11 GMT
• Title: Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)
• Authors: Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser
• Abstract summary: We address the scheduling of realistic semiconductor manufacturing processes by incorporating their specific requirements. Unlike existing methods that schedule manufacturing processes locally with greedy allocations, we examine the potentials of large-scale scheduling.
• Score: 6.422585107162331
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern semiconductor manufacturing involves intricate production processes consisting of hundreds of operations, which can take several months from lot release to completion. The high-tech machines used in these processes are diverse, operate on individual wafers, lots, or batches in multiple stages, and necessitate product-specific setups and specialized maintenance procedures. This situation is different from traditional job-shop scheduling scenarios, which have less complex production processes and machines, and mainly focus on solving highly combinatorial but abstract scheduling problems. In this work, we address the scheduling of realistic semiconductor manufacturing processes by modeling their specific requirements using hybrid Answer Set Programming with difference logic, incorporating flexible machine processing, setup, batching and maintenance operations. Unlike existing methods that schedule semiconductor manufacturing processes locally with greedy heuristics or by independently optimizing specific machine group allocations, we examine the potentials of large-scale scheduling subject to multiple optimization objectives.

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)
• 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)
• Automated Process Planning Based on a Semantic Capability Model and SMT [50.76251195257306]
  In research of manufacturing systems and autonomous robots, the term capability is used for a machine-interpretable specification of a system function. We present an approach that combines these two topics: starting from a semantic capability model, an AI planning problem is automatically generated.
  arXiv  Detail & Related papers  (2023-12-14T10:37:34Z)
• 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)
• 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)
• Multi-Job Intelligent Scheduling with Cross-Device Federated Learning [65.69079337653994]
  Federated Learning (FL) enables collaborative global machine learning model training without sharing sensitive raw data. We propose a novel multi-job FL framework, which enables the training process of multiple jobs in parallel. We propose a novel intelligent scheduling approach based on multiple scheduling methods, including an original reinforcement learning-based scheduling method and an original Bayesian optimization-based scheduling method.
  arXiv  Detail & Related papers  (2022-11-24T06:17:40Z)
• 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)
• Concepts and Algorithms for Agent-based Decentralized and Integrated Scheduling of Production and Auxiliary Processes [78.120734120667]
  This paper describes an agent-based decentralized and integrated scheduling approach. Part of the requirements is to develop a linearly scaling communication architecture. The approach is explained using an example based on industrial requirements.
  arXiv  Detail & Related papers  (2022-05-06T18:44:29Z)
• Efficient Device Scheduling with Multi-Job Federated Learning [64.21733164243781]
  We propose a novel multi-job Federated Learning framework to enable the parallel training process of multiple jobs. We propose a reinforcement learning-based method and a Bayesian optimization-based method to schedule devices for multiple jobs while minimizing the cost. Our proposed approaches significantly outperform baseline approaches in terms of training time (up to 8.67 times faster) and accuracy (up to 44.6% higher)
  arXiv  Detail & Related papers  (2021-12-11T08:05:11Z)
• Process Comparison Using Object-Centric Process Cubes [69.68068088508505]
  In real-life business processes, different behaviors exist that make the overall process too complex to interpret. Process comparison is a branch of process mining that isolates different behaviors of the process from each other by using process cubes. We propose a process cube framework, which supports process cube operations such as slice and dice on object-centric event logs.
  arXiv  Detail & Related papers  (2021-03-12T10:08:28Z)
• Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP [0.4511923587827302]
  We consider a Multi-resource Partial-ordering Flexible Job-shop Scheduling (MPF-JSS) problem. The resources are flexible and can perform one or more operations depending on their properties. Experiments conducted on a set of instances extracted from a medium-sized semiconductor fault analysis lab indicate that our approach can find schedules for 87 out of 91 considered real-world instances.
  arXiv  Detail & Related papers  (2021-01-25T15:21:32Z)

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.