Search results for: flexible job-shop scheduling
1337 Experimental Simulation of Soil Boundary Condition for Dynamic Studies
Authors: Omar S. Qaftan, T. T. Sabbagh
Abstract:
This paper studies the free-field response by adopting a flexible membrane container as soil boundary for experimental shaking table tests. The influence of the soil container boundary on the soil behaviour and the dynamic soil properties under seismic effect were examined. A flexible container with 1/50 scale factor was adopted in the experimental tests, including construction, instrumentation, and determination of the results of dynamic tests on a shaking table. Horizontal face displacements and accelerations were analysed to determine the influence of the container boundary on the performance of the soil. The outputs results show that the flexible boundary container allows more displacement and larger accelerations. The soil in a rigid wall container cannot deform as similar as the soil in the real field does. Therefore, the response of flexible container tested is believed to be more reliable for soil boundary than that in the rigid container.Keywords: soil, seismic, earthquake, interaction
Procedia PDF Downloads 2971336 Supply Chain Optimization Based on Advanced Planning and Scheduling Technology in Manufacturing Industry: A Case Study
Authors: Wenqian Shi, Xie He, Ziyin Huang, Zi Yu
Abstract:
The dramatic changes in the global economic situation have produced dramatic changes to companies’ supply chain systems. A variety of opportunities and challenges make the traditional manufacturing industry feel pressured, and the manufacturing industry must seek a new way out as soon as possible. This paper presents a case study of the advanced planning and scheduling technology problem encountered by an electrical and electronics manufacturer. The objective is to seek the minimum cost of production planning and order management. Digitalization is applied to the problem, and the results demonstrate that significant production performances can be achieved in the face of the existing production of each link and order management systems to analyze and optimize. This paper can also provide some practical implications in various manufacturing industries. Finally, future research directions are discussed.Keywords: advanced planning and scheduling, case study, production planning, supply chain optimization
Procedia PDF Downloads 971335 Fuzzy Logic Control for Flexible Joint Manipulator: An Experimental Implementation
Authors: Sophia Fry, Mahir Irtiza, Alexa Hoffman, Yousef Sardahi
Abstract:
This study presents an intelligent control algorithm for a flexible robotic arm. Fuzzy control is used to control the motion of the arm to maintain the arm tip at the desired position while reducing vibration and increasing the system speed of response. The Fuzzy controller (FC) is based on adding the tip angular position to the arm deflection angle and using their sum as a feedback signal to the control algorithm. This reduces the complexity of the FC in terms of the input variables, number of membership functions, fuzzy rules, and control structure. Also, the design of the fuzzy controller is model-free and uses only our knowledge about the system. To show the efficacy of the FC, the control algorithm is implemented on the flexible joint manipulator (FJM) developed by Quanser. The results show that the proposed control method is effective in terms of response time, overshoot, and vibration amplitude.Keywords: fuzzy logic control, model-free control, flexible joint manipulators, nonlinear control
Procedia PDF Downloads 1171334 Performance Evaluation of Flexible Manufacturing System: A Simulation Study
Authors: Mohammed Ali
Abstract:
In this paper, evaluation of flexible manufacturing system is made under different manufacturing strategies. The objective of this paper is to test the impact of pallets and routing flexibility on system performance operating at different sequencing rules, dispatching rules and at unbalanced load condition. A computer simulation model is developed to evaluate the effects of aforementioned manufacturing strategies on the make-span performance of flexible manufacturing system. The impact of number of pallets is shown with the different levels of routing flexibility. In this paper, the same manufacturing system is modeled under different combination of sequencing and dispatching rules. A series of simulation experiments are conducted and results analyzed. The result of the simulation shows that there is impact of pallets and routing flexibility on the performance of the system.Keywords: flexibility, flexible manufacturing system, pallets, make-span, simulation
Procedia PDF Downloads 4161333 Flexible Poly(vinylidene fluoride-co-hexafluoropropylene) Nanocomposites Filled with Ternary Nanofillers for Energy Harvesting
Authors: D. Ponnamma, E. Alper, P. Sharma, M. A. AlMaadeed
Abstract:
Integrating efficient energy harvesting materials into soft, flexible and eco-friendly substrates could yield significant breakthroughs in wearable and flexible electronics. Here we present a tri phasic filler combination of one-dimensional titanium dioxide nanotubes, two-dimensional reduced graphene oxide, and three-dimensional strontium titanate, introduced into a semi crystalline polymer, Poly(vinylidene fluoride-co-hexafluoropropylene). Simple mixing method is adopted for the composite fabrication after ensuring a high interaction among the various fillers. The films prepared were mainly tested for the piezoelectric responses and the mechanical stretchability. The results show that the piezoelectric constant has increased while changing the total filler concentration. We propose an integration of these materials in fabricating energy conversion devices useful in flexible and wearable electronics.Keywords: dielectric property, hydrothermal growth, piezoelectricity, polymer nanocomposites
Procedia PDF Downloads 2701332 A Model for Operating Rooms Scheduling
Authors: Jose Francisco Ferreira Ribeiro, Alexandre Bevilacqua Leoneti, Andre Lucirton Costa
Abstract:
This paper presents a mathematical model in binary variables 0/1 to make the assignment of surgical procedures to the operating rooms in a hospital. The proposed mathematical model is based on the generalized assignment problem, which maximizes the sum of preferences for the use of the operating rooms by doctors, respecting the time available in each room. The corresponding program was written in Visual Basic of Microsoft Excel, and tested to schedule surgeries at St. Lydia Hospital in Ribeirao Preto, Brazil.Keywords: generalized assignment problem, logistics, optimization, scheduling
Procedia PDF Downloads 2911331 Multi-Subpopulation Genetic Algorithm with Estimation of Distribution Algorithm for Textile Batch Dyeing Scheduling Problem
Authors: Nhat-To Huynh, Chen-Fu Chien
Abstract:
Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing
Procedia PDF Downloads 2981330 Scheduling Jobs with Stochastic Processing Times or Due Dates on a Server to Minimize the Number of Tardy Jobs
Authors: H. M. Soroush
Abstract:
The problem of scheduling products and services for on-time deliveries is of paramount importance in today’s competitive environments. It arises in many manufacturing and service organizations where it is desirable to complete jobs (products or services) with different weights (penalties) on or before their due dates. In such environments, schedules should frequently decide whether to schedule a job based on its processing time, due-date, and the penalty for tardy delivery to improve the system performance. For example, it is common to measure the weighted number of late jobs or the percentage of on-time shipments to evaluate the performance of a semiconductor production facility or an automobile assembly line. In this paper, we address the problem of scheduling a set of jobs on a server where processing times or due-dates of jobs are random variables and fixed weights (penalties) are imposed on the jobs’ late deliveries. The goal is to find the schedule that minimizes the expected weighted number of tardy jobs. The problem is NP-hard to solve; however, we explore three scenarios of the problem wherein: (i) both processing times and due-dates are stochastic; (ii) processing times are stochastic and due-dates are deterministic; and (iii) processing times are deterministic and due-dates are stochastic. We prove that special cases of these scenarios are solvable optimally in polynomial time, and introduce efficient heuristic methods for the general cases. Our computational results show that the heuristics perform well in yielding either optimal or near optimal sequences. The results also demonstrate that the stochasticity of processing times or due-dates can affect scheduling decisions. Moreover, the proposed problem is general in the sense that its special cases reduce to some new and some classical stochastic single machine models.Keywords: number of late jobs, scheduling, single server, stochastic
Procedia PDF Downloads 4961329 Exploring Factors Affecting the Implementation of Flexible Curriculum in Information Systems Higher Education
Authors: Clement C. Aladi, Zhaoxia Yi
Abstract:
This study investigates factors influencing the implementation of flexible curricula in e-learning in Information Systems (IS) higher education. Drawing from curriculum theorists and contemporary literature, and using the Technology, Pedagogy, and Content Knowledge (TPACK) framework, it explores teacher-related challenges and their impact on curriculum flexibility implementation. By using the PLS-SEM, the study uncovers these factors and hopes to contribute to enhancing curriculum flexibility in delivering online and blended learning in IS higher education.Keywords: flexible curriculum, online learning, e-learning, technology
Procedia PDF Downloads 521328 Multi-Objective Variable Neighborhood Search Algorithm to Solving Scheduling Problem with Transportation Times
Authors: Majid Khalili
Abstract:
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms. Procedia PDF Downloads 4161327 Peer-Mediated Interventions as a High-Leverage Practice in Inclusive General Education Classrooms
Authors: Daniel Pyle, Nicole Pyle, Ben Lignugaris-Kraft, Lawrence Maheady
Abstract:
Students with disabilities are not included in general education at the same rate as their peers without disabilities. There are multiple reasons cited for why inclusion rates vary, such as teachers' lack of knowledge of the successful delivery of inclusive practices to students with the most extensive support needs. However, decades of research document effective inclusive practices associated with benefits across domains for students with disabilities. One effective inclusive practice that teachers use to improve outcomes for students with disabilities is flexible grouping. Teachers can use flexible grouping to facilitate students working collaboratively by using peer-mediated interventions (PMIs). This article describes PMIs as a flexible grouping of High Leverage Practices (HLP). There are variations of PMIs to select from when using flexible grouping. PMIs are described by varied grouping arrangements and different instructional procedures to clarify the flexibility of grouping students and students’ roles within those groupings. In support of teachers’ use of flexible grouping in inclusive general education classrooms, we identify different PMI formats teachers can use depending on the preferred grouping arrangement, explain the distinctive characteristics of PMI models to distinguish expected procedures with peers, highlight outcomes associated with PMIs, and provide an overview of evaluating PMIs effectiveness.Keywords: peer-mediated interventions, high leverage practices, flexible grouping, general education, special education
Procedia PDF Downloads 741326 A Mathematical Model for a Two-Stage Assembly Flow-Shop Scheduling Problem with Batch Delivery System
Authors: Saeedeh Ahmadi Basir, Mohammad Mahdavi Mazdeh, Mohammad Namakshenas
Abstract:
Manufacturers often dispatch jobs in batches to reduce delivery costs. However, sending several jobs in batches can have a negative effect on other scheduling-related objective functions such as minimizing the number of tardy jobs which is often used to rate managers’ performance in many manufacturing environments. This paper aims to minimize the number of weighted tardy jobs and the sum of delivery costs of a two-stage assembly flow-shop problem in a batch delivery system. We present a mixed-integer linear programming (MILP) model to solve the problem. As this is an MILP model, the commercial solver (the CPLEX solver) is not guaranteed to find the optimal solution for large-size problems at a reasonable amount of time. We present several numerical examples to confirm the accuracy of the model.Keywords: scheduling, two-stage assembly flow-shop, tardy jobs, batched delivery system
Procedia PDF Downloads 4581325 A Performance Comparison between Conventional and Flexible Box Erecting Machines Using Dispatching Rules
Authors: Min Kyu Kim, Eun Young Lee, Dong Woo Son, Yoon Seok Chang
Abstract:
In this paper, we introduce a flexible box erecting machine (BEM) that swiftly and automatically transforms cardboard into a three dimensional box. Recently, the parcel service and home-shopping industries have grown rapidly, and there is an increasing need for various box types to ship various products. However, workers cannot fold thousands of boxes manually in a day. As such, automatic BEMs are garnering greater attention. This study takes equipment operation into consideration as well as mechanical improvements in order to design a BEM that is able to outperform its conventional counterparts. We analyzed six dispatching rules – First In First Out (FIFO), Shortest Processing Time (SPT), Earliest Due Date (EDD), Setup Avoidance, EDD + SPT, and EDD + Setup Avoidance – to determine which one was most suitable for BEM operation. Consequently, SPT and Setup Avoidance were found to be the most critical rules, followed by EDD + Setup Avoidance, EDD + SPT, EDD, and FIFO. This hierarchy was valid for both our conventional BEM and our new flexible BEM from the viewpoint of processing time. We believe that this research can contribute to flexible BEM management, which has the potential to increase productivity and convenience.Keywords: automation, box erecting machine, dispatching rule, setup time
Procedia PDF Downloads 3611324 Performance Evaluation of Production Schedules Based on Process Mining
Authors: Kwan Hee Han
Abstract:
External environment of enterprise is rapidly changing majorly by global competition, cost reduction pressures, and new technology. In these situations, production scheduling function plays a critical role to meet customer requirements and to attain the goal of operational efficiency. It deals with short-term decision making in the production process of the whole supply chain. The major task of production scheduling is to seek a balance between customer orders and limited resources. In manufacturing companies, this task is so difficult because it should efficiently utilize resource capacity under the careful consideration of many interacting constraints. At present, many computerized software solutions have been utilized in many enterprises to generate a realistic production schedule to overcome the complexity of schedule generation. However, most production scheduling systems do not provide sufficient information about the validity of the generated schedule except limited statistics. Process mining only recently emerged as a sub-discipline of both data mining and business process management. Process mining techniques enable the useful analysis of a wide variety of processes such as process discovery, conformance checking, and bottleneck analysis. In this study, the performance of generated production schedule is evaluated by mining event log data of production scheduling software system by using the process mining techniques since every software system generates event logs for the further use such as security investigation, auditing and error bugging. An application of process mining approach is proposed for the validation of the goodness of production schedule generated by scheduling software systems in this study. By using process mining techniques, major evaluation criteria such as utilization of workstation, existence of bottleneck workstations, critical process route patterns, and work load balance of each machine over time are measured, and finally, the goodness of production schedule is evaluated. By using the proposed process mining approach for evaluating the performance of generated production schedule, the quality of production schedule of manufacturing enterprises can be improved.Keywords: data mining, event log, process mining, production scheduling
Procedia PDF Downloads 2791323 Design Approach for the Development of Format-Flexible Packaging Machines
Authors: G. Götz, P. Stich, J. Backhaus, G. Reinhart
Abstract:
The rising demand for format-flexible packaging machines is caused by current market changes. Increasing the formatflexibility is a new goal for the packaging machine manufacturers’ product development process. There are no methodical or designorientated tools for a comprehensive consideration of this target. This paper defines the term format-flexibility in the context of packaging machines and shows the state-of-the-art for improving the changeover of production machines. The requirements for a new approach and the concept itself will be introduced, and the method elements will be explained. Finally, the use of the concept and the result of the development of a format-flexible packaging machine will be shown.Keywords: packaging machine, format-flexibility, changeover, design method
Procedia PDF Downloads 4311322 An Improved Approach Based on MAS Architecture and Heuristic Algorithm for Systematic Maintenance
Authors: Abdelhadi Adel, Kadri Ouahab
Abstract:
This paper proposes an improved approach based on MAS Architecture and Heuristic Algorithm for systematic maintenance to minimize makespan. We have implemented a problem-solving approach for optimizing the processing time, methods based on metaheuristics. The proposed approach is inspired by the behavior of the human body. This hybridization is between a multi-agent system and inspirations of the human body, especially genetics. The effectiveness of our approach has been demonstrated repeatedly in this paper. To solve such a complex problem, we proposed an approach which we have used advanced operators such as uniform crossover set and single point mutation. The proposed approach is applied to three preventive maintenance policies. These policies are intended to maximize the availability or to maintain a minimum level of reliability during the production chain. The results show that our algorithm outperforms existing algorithms. We assumed that the machines might be unavailable periodically during the production scheduling.Keywords: multi-agent systems, emergence, genetic algorithm, makespan, systematic maintenance, scheduling, hybrid flow shop scheduling
Procedia PDF Downloads 2991321 Multithreading/Multiprocessing Simulation of The International Space Station Multibody System Using A Divide and Conquer Dynamics Formulation with Flexible Bodies
Authors: Luong A. Nguyen, Elihu Deneke, Thomas L. Harman
Abstract:
This paper describes a multibody dynamics algorithm formulated for parallel implementation on multiprocessor computing platforms using the divide-and-conquer approach. The system of interest is a general topology of rigid and elastic articulated bodies with or without loops. The algorithm is an extension of Featherstone’s divide and conquer approach to include the flexible-body dynamics formulation. The equations of motion, configured for the International Space Station (ISS) with its robotic manipulator arm as a system of articulated flexible bodies, are implemented in separate computer processors. The performance of this divide-and-conquer algorithm implementation in multiple processors is compared with an existing method implemented on a single processor.Keywords: multibody dynamics, multiple processors, multithreading, divide-and-conquer algorithm, computational efficiency, flexible body dynamics
Procedia PDF Downloads 3351320 Flexible Furniture in Urban Open Spaces: A Tool to Achieve Social Sustainability
Authors: Mahsa Ghafouri, Guita Farivarsadri
Abstract:
In urban open spaces, furniture plays a crucial role in meeting various needs of the users over time. Furniture consists of elements that not only can facilitate physical needs individually but also fulfill social, psychological, and cultural demands on an urban scale. Creating adjustable urban spaces and using flexible furniture can provide the possibility of using urban spaces for a wide range of uses and activities and allow the engagement of users with distinct abilities and limitations in these activities. Flexibility in urban furniture can be seen as designing a number of modular components that are movable, expandable, adjustable, and changeable to accommodate various functions. Although there is a great amount of research related to flexibility and its distinct insights into achieving spaces that can cope with changing demands, this fundamental issue is often neglected in the design of urban furniture. However, in the long term, to address changing public needs over time, it can be logical to bring this quality into the design process to make spaces that can be sustained for a long time. This study aims to first introduce diverse kinds of flexible furniture that can be designed for urban public spaces and then to realize how this flexible furniture can improve the quality of public open spaces and social interaction and make them more adaptable over time and, as a result, achieve social sustainability. This research is descriptive and is mainly based on an extensive literature review and the analysis and classification of existing examples around the world. This research tends to illustrate various kinds of approaches that can help designers create flexible furniture to enhance the sustainability and quality of urban open spaces and, in this way, act as a guide for urban designers in this respect.Keywords: flexible furniture, flexible design, urban open spaces, adaptability, moveability, social sustainability
Procedia PDF Downloads 581319 Optimization of Production Scheduling through the Lean and Simulation Integration in Automotive Company
Authors: Guilherme Gorgulho, Carlos Roberto Camello Lima
Abstract:
Due to the competitive market in which companies are currently engaged, the constant changes require companies to react quickly regarding the variability of demand and process. The changes are caused by customers, or by demand fluctuations or variations of products, or the need to serve customers within agreed delivery taking into account the continuous search for quality and competitive prices in products. These changes end up influencing directly or indirectly the activities of the Planning and Production Control (PPC), which does business in strategic, tactical and operational levels of production systems. One area of concern for organizations is in the short term (operational level), because this planning stage any error or divergence will cause waste and impact on the delivery of products on time to customers. Thus, this study aims to optimize the efficiency of production scheduling, using different sequencing strategies in an automotive company. Seeking to aim the proposed objective, we used the computer simulation in conjunction with lean manufacturing to build and validate the current model, and subsequently the creation of future scenarios.Keywords: computational simulation, lean manufacturing, production scheduling, sequencing strategies
Procedia PDF Downloads 2691318 A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh
Abstract:
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm
Procedia PDF Downloads 3531317 Optimal Scheduling of Trains in Complex National Scale Railway Networks
Authors: Sanat Ramesh, Tarun Dutt, Abhilasha Aswal, Anushka Chandrababu, G. N. Srinivasa Prasanna
Abstract:
Optimal Schedule Generation for a large national railway network operating thousands of passenger trains with tens of thousands of kilometers of track is a grand computational challenge in itself. We present heuristics based on a Mixed Integer Program (MIP) formulation for local optimization. These methods provide flexibility in scheduling new trains with varying speed and delays and improve utilization of infrastructure. We propose methods that provide a robust solution with hundreds of trains being scheduled over a portion of the railway network without significant increases in delay. We also provide techniques to validate the nominal schedules thus generated over global correlated variations in travel times thereby enabling us to detect conflicts arising due to delays. Our validation results which assume only the support of the arrival and departure time distributions takes an order of few minutes for a portion of the network and is computationally efficient to handle the entire network.Keywords: mixed integer programming, optimization, railway network, train scheduling
Procedia PDF Downloads 1581316 An Intelligent Thermal-Aware Task Scheduler in Multiprocessor System on a Chip
Authors: Sina Saadati
Abstract:
Multiprocessors Systems-On-Chips (MPSOCs) are used widely on modern computers to execute sophisticated software and applications. These systems include different processors for distinct aims. Most of the proposed task schedulers attempt to improve energy consumption. In some schedulers, the processor's temperature is considered to increase the system's reliability and performance. In this research, we have proposed a new method for thermal-aware task scheduling which is based on an artificial neural network (ANN). This method enables us to consider a variety of factors in the scheduling process. Some factors like ambient temperature, season (which is important for some embedded systems), speed of the processor, computing type of tasks and have a complex relationship with the final temperature of the system. This Issue can be solved using a machine learning algorithm. Another point is that our solution makes the system intelligent So that It can be adaptive. We have also shown that the computational complexity of the proposed method is cheap. As a consequence, It is also suitable for battery-powered systems.Keywords: task scheduling, MOSOC, artificial neural network, machine learning, architecture of computers, artificial intelligence
Procedia PDF Downloads 1011315 Generic Model for Timetabling Problems by Integer Linear Programmimg Approach
Authors: Nur Aidya Hanum Aizam, Vikneswary Uvaraja
Abstract:
The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming model to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describe about creating a general model which solve different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints.Keywords: AIMMS mathematical software, integer linear programming, scheduling problems, timetabling
Procedia PDF Downloads 4351314 Adaptive Kaman Filter for Fault Diagnosis of Linear Parameter-Varying Systems
Authors: Rajamani Doraiswami, Lahouari Cheded
Abstract:
Fault diagnosis of Linear Parameter-Varying (LPV) system using an adaptive Kalman filter is proposed. The LPV model is comprised of scheduling parameters, and the emulator parameters. The scheduling parameters are chosen such that they are capable of tracking variations in the system model as a result of changes in the operating regimes. The emulator parameters, on the other hand, simulate variations in the subsystems during the identification phase and have negligible effect during the operational phase. The nominal model and the influence vectors, which are the gradient of the feature vector respect to the emulator parameters, are identified off-line from a number of emulator parameter perturbed experiments. A Kalman filter is designed using the identified nominal model. As the system varies, the Kalman filter model is adapted using the scheduling variables. The residual is employed for fault diagnosis. The proposed scheme is successfully evaluated on simulated system as well as on a physical process control system.Keywords: identification, linear parameter-varying systems, least-squares estimation, fault diagnosis, Kalman filter, emulators
Procedia PDF Downloads 4981313 Modeling Operating Theater Scheduling and Configuration: An Integrated Model in Health-Care Logistics
Authors: Sina Keyhanian, Abbas Ahmadi, Behrooz Karimi
Abstract:
We present a multi-objective binary programming model which considers surgical cases are scheduling among operating rooms and the configuration of surgical instruments in limited capacity hospital trays, simultaneously. Many mathematical models have been developed previously in the literature addressing different challenges in health-care logistics such as assigning operating rooms, leveling beds, etc. But what happens inside the operating rooms along with the inventory management of required instruments for various operations, and also their integration with surgical scheduling have been poorly discussed. Our model considers the minimization of movements between trays during a surgery which recalls the famous cell formation problem in group technology. This assumption can also provide a major potential contribution to robotic surgeries. The tray configuration problem which consumes surgical instruments requirement plan (SIRP) and sequence of surgical procedures based on required instruments (SIRO) is nested inside the bin packing problem. This modeling approach helps us understand that most of the same-output solutions will not be necessarily identical when it comes to the rearrangement of surgeries among rooms. A numerical example has been dealt with via a proposed nested simulated annealing (SA) optimization approach which provides insights about how various configurations inside a solution can alter the optimal condition.Keywords: health-care logistics, hospital tray configuration, off-line bin packing, simulated annealing optimization, surgical case scheduling
Procedia PDF Downloads 2811312 Critical Activity Effect on Project Duration in Precedence Diagram Method
Authors: Salman Ali Nisar, Koshi Suzuki
Abstract:
Precedence Diagram Method (PDM) with its additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activities provides more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in PDM network will have anomalous effect on critical path. Researchers have proposed some classification of critical activity effects. In this paper, we do further study on classifications of critical activity effect and provide more information in detailed. Furthermore, we determine the maximum amount of time for each class of critical activity effect by which the project managers can control the dynamic feature (shortening/lengthening) of critical activities and project duration more efficiently.Keywords: construction project management, critical path method, project scheduling, precedence diagram method
Procedia PDF Downloads 5091311 Using the Simple Fixed Rate Approach to Solve Economic Lot Scheduling Problem under the Basic Period Approach
Authors: Yu-Jen Chang, Yun Chen, Hei-Lam Wong
Abstract:
The Economic Lot Scheduling Problem (ELSP) is a valuable mathematical model that can support decision-makers to make scheduling decisions. The basic period approach is effective for solving the ELSP. The assumption for applying the basic period approach is that a product must use its maximum production rate to be produced. However, a product can lower its production rate to reduce the average total cost when a facility has extra idle time. The past researches discussed how a product adjusts its production rate under the common cycle approach. To the best of our knowledge, no studies have addressed how a product lowers its production rate under the basic period approach. This research is the first paper to discuss this topic. The research develops a simple fixed rate approach that adjusts the production rate of a product under the basic period approach to solve the ELSP. Our numerical example shows our approach can find a better solution than the traditional basic period approach. Our mathematical model that applies the fixed rate approach under the basic period approach can serve as a reference for other related researches.Keywords: economic lot, basic period, genetic algorithm, fixed rate
Procedia PDF Downloads 5611310 Encapsulation of Flexible OLED with an Auxiliary Sealing Line
Authors: Hanjun Yun, Gun Bae, Nabin Paul, Cheolhee Moon
Abstract:
Flexible OLED is an important technology for the next generation display over various kinds of applications. However, the organic materials of OLEDs degrade rapidly under the invasion of oxygen and water moisture. The degradation causes the formation of non-emitting areas which gradually suppress the device brightness, ultimately the lifetime of the device decreasing rapidly. Until now, the most suitable sealing process of the flexible OLED devices is a thin film encapsulation (TFE). However, TFE consists of a multilayer thin-film structure with organic-inorganic materials, so the cost is expensive and the process time is long. Another problem is that the blocking characteristics from the moisture and oxygen are not perfect. Therefore, the encapsulation of the flexible OLED device is a still key technical issue for the successful market entry. In this study, we are to introduce an auxiliary sealing line between the two flexible substrates. The electrode lines were formed on the substrates which have a SiNx barrier coating layer. To induce the solid phase diffusion process between the SiNx layer and the electrode lines, the electrode materials were determined as Al-Si composition. Thermal energy was supplied for both the SiNx layer and Al-Si electrode lines within the furnace to induce the interfacial bonding through the solid phase diffusion of Si. We printed a test pattern for the edge of the flexible PET substrate of 3cm*3cm size. Experimental conditions such as heating temperature, heating time were optimized to get enough adhesion strength which was estimated through the competitive bending test. Finally, OLED devices with flexible PET substrate of 3cm*3cm size were manufactured to investigate the blocking characteristics as an encapsulation layer.Keywords: barrier, encapsulation, OLED, solid phase diffusion
Procedia PDF Downloads 2351309 Dynamic Synthesis of a Flexible Multibody System
Authors: Mohamed Amine Ben Abdallah, Imed Khemili, Nizar Aifaoui
Abstract:
This work denotes an insight into dynamic synthesis of multibody systems. A set of mechanism parameters design variable are synthetized based on a desired mechanism response, such as, velocity, acceleration and bodies deformations. Moreover, knowing the work space, for a robot, and mechanism response allow defining optimal parameters mechanism handling with the desired target response. To this end, evolutionary genetic algorithm has been deployed. A demonstrative example for imperfect mechanism has been treated, mainly, a slider crank mechanism with a flexible connecting rod. The transversal deflection of the connecting rod has been chosen as response to identify the mechanism design parameters.Keywords: dynamic response, evolutionary genetic algorithm, flexible bodies, optimization
Procedia PDF Downloads 3181308 Flexible Laser Reduced Graphene Oxide/MnO2 Electrode for Supercapacitor Applications
Authors: Ingy N. Bkrey, Ahmed A. Moniem
Abstract:
We succeeded to produce a high performance and flexible graphene/Manganese dioxide (G/MnO2) electrode coated on flexible polyethylene terephthalate (PET) substrate. The graphene film is initially synthesized by drop-casting the graphene oxide (GO) solution on the PET substrate, followed by simultaneous reduction and patterning of the dried film using carbon dioxide (CO2) laser beam with power of 1.8 W. Potentiostatic Anodic Deposition method was used to deposit thin film of MnO2 with different loading mass 10 – 50 and 100 μg.cm-2 on the pre-prepared graphene film. The electrodes were fully characterized in terms of structure, morphology, and electrochemical performance. A maximum specific capacitance of 973 F.g-1 was attributed when depositing 50 μg.cm-2 MnO2 on the laser reduced graphene oxide rGO (or G/50MnO2) and over 92% of its initial capacitance was retained after 1000 cycles. The good electrochemical performance and long-term cycling stability make our proposed approach a promising candidate in the supercapacitor applications.Keywords: electrode deposition, flexible, graphene oxide, graphene, high power CO2 Laser, MnO2
Procedia PDF Downloads 315