Integrated Maintenance Decision-Making and Product Sequencing in Flexible Manufacturing Systems

Author(s):  
Merve Celen ◽  
Dragan Djurdjanovic

In highly flexible and integrated manufacturing systems, such as semiconductor manufacturing, the strong dynamic interactions between the equipment condition, operations executed on the equipment, and the resulting product quality necessitate a methodology that integrates the decision-making process across the domains of maintenance scheduling and production operations. Currently, maintenance and production operations decision-making are two decoupled processes. In this paper, we devise an integrated decision-making policy for maintenance scheduling and production sequencing, with the objective of optimizing a customizable objective function, while taking into account operation-dependent degradation models and a production target. Optimization was achieved using a metaheuristic method based on the results of discrete-event simulations of the target manufacturing system. The new approach is demonstrated in simulations of a generic cluster tool routinely used in semiconductor manufacturing. The results show that jointly making maintenance and production sequencing decisions consistently and often significantly outperforms the current practice of making these decisions separately.

Author(s):  
Merve Celen ◽  
Dragan Djurdjanovic

In highly flexible and integrated manufacturing systems such as those in semiconductor manufacturing, there exist strong dynamic interactions between the equipment condition, operations executed on the equipment and the resulting product quality. These interactions necessitate a methodology that integrates the decisions of maintenance scheduling and production operations. Currently, maintenance and production operations decision-making are two decoupled processes. In this paper we aim to devise an integrated decision making policy for maintenance scheduling and production sequencing with the objective of maximizing an adaptive profit function, while taking into account operation-dependent degradation models and a production target. In order to obtain the optimal decision policy, a metaheuristic method based on the results of discrete-event simulations of the target manufacturing system is used. The new approach is demonstrated in simulations of a generic cluster tool routinely used in semiconductor manufacturing. The results show that jointly making maintenance and production sequencing decisions consistently outperforms the current practice of making these decisions separately.


Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6333 ◽  
Author(s):  
Fengjia Yao ◽  
Bugra Alkan ◽  
Bilal Ahmad ◽  
Robert Harrison

Autonomous guided vehicles (AGVs) are driverless material handling systems used for transportation of pallets and line side supply of materials to provide flexibility and agility in shop-floor logistics. Scheduling of shop-floor logistics in such systems is a challenging task due to their complex nature associated with the multiple part types and alternate material transfer routings. This paper presents a decision support system capable of supporting shop-floor decision-making activities during the event of manufacturing disruptions by automatically adjusting both AGV and machine schedules in Flexible Manufacturing Systems (FMSs). The proposed system uses discrete event simulation (DES) models enhanced by the Internet-of-Things (IoT) enabled digital integration and employs a nonlinear mixed integer programming Genetic Algorithm (GA) to find near-optimal production schedules prioritising the just-in-time (JIT) material delivery performance and energy efficiency of the material transportation. The performance of the proposed system is tested on the Integrated Manufacturing and Logistics (IML) demonstrator at WMG, University of Warwick. The results showed that the developed system can find the near-optimal solutions for production schedules subjected to production anomalies in a negligible time, thereby supporting shop-floor decision-making activities effectively and rapidly.


2008 ◽  
Vol 9 (3-4) ◽  
pp. 277-293 ◽  
Author(s):  
Navodit Misra ◽  
Daniel Lees ◽  
Tiequan Zhang ◽  
Russell Schwartz

As computational and mathematical studies become increasingly central to studies of complicated reaction systems, it will become ever more important to identify the assumptions our models must make and determine when those assumptions are valid. Here, we examine that question with respect to viral capsid assembly by studying the ‘pathway complexity’ of model capsid assembly systems, which we informally define as the number of reaction pathways and intermediates one must consider to accurately describe a given system. We use two model types for this study: ordinary differential equation models, which allow us to precisely and deterministically compare the accuracy of capsid models under different degrees of simplification, and stochastic discrete event simulations, which allow us to sample use of reaction intermediates across a wide parameter space allowing for an extremely large number of possible reaction pathways. The models provide complementary information in support of a common conclusion that the ability of simple pathway models to adequately explain capsid assembly kinetics varies considerably across the space of biologically meaningful assembly parameters. These studies provide grounds for caution regarding our ability to reliably represent real systems with simple models and to extrapolate results from one set of assembly conditions to another. In addition, the analysis tools developed for this study are likely to have broader use in the analysis and efficient simulation of large reaction systems.


Author(s):  
Dimitri Lefebvre

Petri nets have been widely used for the modelling, analysis, control and optimization of discrete event systems with shared resources in the domains of engineering. This article concerns the design of control sequences for such systems modelled with untimed Petri nets. The aim of the controller is to incrementally compute sequences of transition firings with minimal size. Such sequences aim to move the marking from an initial value to a reference value. The resulting trajectory must avoid some forbidden markings and limit as possible the exploration of non-promising branches. For this purpose, the approach explores a small part of the reachability graph in the neighbourhood of the current marking. Then from the explored markings, it estimates a distance to the reference. The main contributions are (a) to reduce the explored part of the reachability graph according to a double limitation in breadth and in depth in order to provide solutions with a low computational effort; (b) to provide conditions to ensure the converge and optimality of the proposed algorithms and derive necessary and sufficient conditions for reachability; and (c) to include the firing sequence design in a global control schema suitable for reactive scheduling problems in uncertain and perturbed environments. The main application concerns deadlock-free scheduling problems in the domain of flexible manufacturing systems, but the approach is also applicable for systems in computer science and transportation.


Author(s):  
Wujie Chao ◽  
Yongmei Gan ◽  
W. M. Wonham ◽  
Zhaoan Wang

Much research has been addressed to nonblocking supervisory control of Discrete-Event Systems (DES) such as Flexible Manufacturing Systems (FMS), and a variety of approaches have been developed. One especially powerful approach, due to Chuan Ma, is based on DES representation by means of State Tree Structures (STS). Using STS, this chapter develops nonblocking supervisory control of a well-known benchmark FMS example taken from the literature, for which the description was given originally as a Petri net. The authors straightforwardly obtain the optimal (maximally permissive) and nonblocking supervisory control, and display the control logic for each (controllable) event transparently as a binary decision diagram.


1999 ◽  
Vol 22 (2) ◽  
pp. 231-239
Author(s):  
Chun‐Lien Su ◽  
Chan‐Nan Lu ◽  
Yuh‐Tzong Lin ◽  
King‐Chun Tu

Sign in / Sign up

Export Citation Format

Share Document