Search results for: reactive scheduling

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 497

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.

Keywords: no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness

Procedia PDF Downloads 418

Authors: Isaac Quiros-Fernandez, Angel Cid-Arregui

Abstract:

Tumor-reactive T cell receptors (TCRs) are being subject of intense investigation since they offer great potential in adoptive cell therapies against cancer. However, the identification of tumor-specific TCRs has proven challenging, for instance, due to the limited expansion capacity of tumor-infiltrating T cells (TILs) and the extremely low frequencies of tumor-reactive T cells in the repertoire of patients and healthy donors. We have developed an approach for rapid identification and characterization of neoepitope-reactive TCRs from the T cell repertoire of healthy donors. CD8 T cells isolated from multiple donors are subjected to a first sorting step after staining with HLA multimers carrying the peptide of interest. The isolated cells are expanded for two weeks, after which a second sorting is performed using the same peptide-HLA multimers. The cells isolated in this way are then processed for single-cell sequencing of their TCR alpha and beta chains. Newly identified TCRs are cloned in appropriate expression vectors for functional analysis on Jurkat, NK92, and primary CD8 T cells and tumor cells expressing the appropriate antigen. We have identified TCRs specifically binding HLA-A2 presenting epitopes of tumor antigens, which are capable of inducing TCR-mediated cell activation and cytotoxicity in target cancer cell lines. This method allows the identification of tumor-reactive TCRs in about two to three weeks, starting from peripheral blood samples of readily available healthy donors.

Keywords: cancer, TCR, tumor antigens, immunotherapy

Procedia PDF Downloads 69

Authors: Anuradha Ranawakage, Chathurani Silva

Abstract:

With the growing expansion of global businesses, supply chains are increasingly exposed to numerous disruptions. Organizations adopt various strategies to mitigate the impact of these disruptions. Depending on the variations in the conditions and characteristics of supply chains, the adoption of resilience strategies may vary across industries. However, these differences are largely unexplored in the existing literature. Hence, this study aims to evaluate the adoption of three proactive strategies: proactive collaboration, digital connectivity, integrated SC risk management, and three reactive strategies: reactive collaboration, inventory and reserve capacity, and lifeline maintenance in the apparel and construction industries in Sri Lanka. An online questionnaire was used to collect data on the implementation of resilience strategies from a sample of 162 apparel and 185 construction companies operating in Sri Lanka. This research makes a significant contribution to the field of supply chain management by assessing the extent to which different resilience strategies are functioned within the apparel and construction industries in Sri Lanka, particularly in an era after a global pandemic that significantly disrupted supply chains all around the world.

Keywords: apparel, construction, proactive strategies, reactive strategies, supply chain resilience

Procedia PDF Downloads 55

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 460

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid particle swarm optimization algorithm is proposed for the multi-objective flexible job shop scheduling problem that is very important and hard combinatorial problem. The Pareto approach is used for solving the multi-objective problem. Several new local search heuristics are integrated into an algorithm based on the critical block concept to enhance the performance of the algorithm. The algorithm is compared with the recently published multi-objective algorithms based on benchmarks selected from the literature. Several metrics are used for quantifying performance and comparison of the achieved solutions. The algorithms are also compared based on the Weighting summation of objectives approach. The proposed algorithm can find the Pareto solutions more efficiently than the compared algorithms in less computational time.

Keywords: swarm-based optimization, local search, Pareto optimality, flexible job shop scheduling, multi-objective optimization

Procedia PDF Downloads 368

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 279

Authors: Yaseen Elhebshi, Abdulkareem Hamid, Nureddin Bin Issa, Xiaonong Chen

Abstract:

A convenient method of preparing ultrafine polystyrene latex nano-particles with amino groups on the surface is developed. Polystyrene latexes in the size range 50–400 nm were prepared via emulsion polymerization, using sodium dodecyl sulfate (SDS) as surfactant. Polystyrene with amino groups on the surface will be fine to use as organic filler to modify rubber. Transmission electron microscopy (TEM) was used to observe the morphology of silicon dioxide and functionalized polystyrene nano-particles. The nature of bonding between the polymer and the reactive groups on the filler surfaces was analyzed using Fourier transform infrared spectroscopy (FTIR). Scanning electron microscopy (SEM) was employed to examine the filler surface.

Keywords: reactive filler, emulsion polymerization, particle size, polystyrene nanoparticles

Procedia PDF Downloads 350

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 301

Authors: Cise Unluer

Abstract:

Reactive MgO hydrates to form brucite (Mg(OH)2, magnesium hydroxide), which can then react with CO2 and additional water to form a range of strength providing hydrated magnesium carbonates (HMCs) within cement-based formulations. The presented work focuses on the use of reactive MgO in a range of concrete mixes, where it carbonates by absorbing CO2 and gains strength accordingly. The main goal involves maximizing the amount of CO2 absorbed within construction products, thereby reducing the overall environmental impact of the designed formulations. Microstructural analyses including scanning electron microscopy (SEM), X-ray diffraction (XRD) and thermogravimetry/differential thermal analysis (TG/DTA) are used in addition to porosity, permeability and unconfined compressive strength (UCS) testing to understand the performance mechanisms. XRD Reference Intensity Ratio (RIR), acid digestion and TG/DTA are utilized to quantify the amount of CO2 sequestered, with the goal of achieving 100% carbonation through careful mix design, leading to a range of carbon neutral products with high strengths. As a result, samples stronger than those containing Portland cement (PC) were produced, revealing the link between the mechanical performance and microstructural development of the developed formulations with the amount of CO2 sequestered.

Keywords: carbonation, compressive strength, reactive MgO cement, sustainability

Procedia PDF Downloads 180

Authors: Sakshi Batra, Suresh Gupta, Pratik Pande, Navneet Kaur, Lovdeep Kaur

Abstract:

The objective of this study is removal of Methylene blue dye or reactive orange-16 from industrial waste water or from soil using bioremediation technique. As huge amount of dyes are releasing from textile industry in water and soil environment during dyeing process. In this study, we focused on removal of Methylene blue dye and Reactive orange dye from industrial soil at different initial concentration of dye. An experiment study was carried out at methylene blue dye or Reactive orange-16 dye at varying concentration of both the dye as 50 ppm, 100ppm, 200 ppm, 300 ppm and 400 ppm. Maximum removal is obtained at 16-20 hours Experiments are carried out for pH, Temperature and MSM composition. The final concentration has been observed by UV-VIS. The two species has been isolated from the Industrial effluent. Finally the product analysis has been done by GC-MS.

Keywords: bioremediation, cultural growth, dyes, environment

Procedia PDF Downloads 319

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 271

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 354

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 158

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 103

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 436

Authors: O. Abdelkhalek, A. Naimi, M. Rami, M. N. Tandjaoui, A. Kechich

Abstract:

This paper deals with the active and reactive power flow analysis inside the unified power quality conditioner (UPQC) during several cases. The UPQC is a combination of shunt and series active power filter (APF). It is one of the best solutions towards the mitigation of voltage sags and swells problems on distribution network. This analysis can provide the helpful information to well understanding the interaction between the series filter, the shunt filter, the DC bus link and electrical network. The mathematical analysis is based on active and reactive power flow through the shunt and series active power filter. Wherein series APF can absorb or deliver the active power to mitigate a swell or sage voltage where in the both cases it absorbs a small reactive power quantity whereas the shunt active power absorbs or releases the active power for stabilizing the storage capacitor’s voltage as well as the power factor correction. The voltage sag and voltage swell are usually interpreted through the DC bus voltage curves. These two phenomena are introduced in this paper with a new interpretation based on the active and reactive power flow analysis inside the UPQC. For simplifying this study, a linear load is supposed in this digital simulation. The simulation results are carried out to confirm the analysis done.

Keywords: UPQC, Power flow analysis, shunt filter, series filter.

Procedia PDF Downloads 572

Authors: Muhammad Afzal, Junaid Uzair Satti

Abstract:

The noise emanating from the ducting of heating, ventilation, and air-conditioning (HVAC) system is often attenuated by using the dissipative silencers. Such devices work well for the high-frequency noise but are less operative in the low-frequency noise range. The present study analyzes a reactive silencer comprising expansion chamber of the elastic membranes partitioned symmetrically by a rigid plate. The Mode-Matching scheme has been developed to solve the governing boundary value problem. The orthogonal and non-orthogonal duct modes of acoustic pressures and normal velocities are matched at interfaces. It enables to recast the differential system into the infinite system of linear algebraic of equations, which is, then truncated and inverted for the solution. The truncated solution is validated through the conservation of energy and reconstruction of matching conditions. The results for scattering energy flux and transmission loss are shown against frequency and the dimensions of the chamber. It is seen that the stop-band of the silencer can be shifted to the broadband by changing the dimensions of the chamber and the properties of the elastic membranes. The modeled reactive silencer is more efficient in low frequency regime where the passive devices are least effective.

Keywords: acoustic scattering, elastic membranes mode-matching, reactive silencer

Procedia PDF Downloads 146

Authors: Pyung Soo Kim

Abstract:

This paper proposes an optimized reactive fast intermobility anchor point (MAP) handover scheme for Hierarchical Mobile IPv6, called the ORFH-HMIPv6, to minimize packet loss of the existing scheme. The key idea of the proposed ORFHHMIPv6 scheme is that the serving MAP buffers packets toward the mobile node (MN) as soon as the link layer between MN and serving base station is disconnected. To implement the proposed scheme, the MAP discovery message exchanged between MN and serving MAP is extended. In addition, the IEEE 802.21 Media Independent Handover Function (MIHF) event service message is defined newly. Through analytic performance evaluation, the proposed ORFH-HMIPv6 scheme can be shown to minimize packet loss much than the existing scheme.

Keywords: hierarchical mobile IPv6 (HMIPv6), fast handover, reactive behavior, packet loss

Procedia PDF Downloads 213

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 499

Authors: Chi-Wai Kan, Yanming Wang, Alan Yiu-Lun Tang, Cheng-Hao Lee Lee

Abstract:

Dyeing of polyester/cotton blend fabrics in various polyester/cotton percentages (32/68, 40/60 and 65/35) was investigated using (poly(ethylene glycol), PEG) based reverse-micelle. High energy disperse dyes and warm type reactive dyes were encapsulated and applied on polyester/cotton blend fabrics in a one bath one step dyeing process. Comparison of reverse micellar-based and aqueous-based (water-based) dyeing was conducted in terms of colour reflectance. Experimental findings revealed that the colour shade of the dyed fabrics in reverse micellar non-aqueous dyeing system at a lower dyeing temperature of 98°C is slightly lighter than that of conventional aqueous dyeing system in two-step process (130oC for disperse dyeing and 70°C for reactive dyeing). The exhaustion of dye in polyester-cotton blend fabrics, in terms of colour reflectance, were found to be highly fluctuated at dyeing temperature of 98°C.

Keywords: one-bath dyeing, polyester/cotton blends, disperse/reactive dyes, reverse micelle

Procedia PDF Downloads 150

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 282

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 563

Authors: Esma Gizem Daskiran, Mehmet Mustafa Daskiran

Abstract:

This paper investigates the effectiveness of two natural zeolites in reducing expansion of concrete due to alkali-silica reaction. These natural zeolites have different reactive silica content. Three aggregates; two natural sand and one crushed stone aggregate were used while preparing mortar bars in accordance with accelerated mortar bar test method, ASTM C1260. Performance of natural zeolites are compared by examining the expansions due to alkali silica reaction. Natural zeolites added to the mixtures at %10 and %20 replacement levels by weight of cement. Natural zeolite with high reactive silica content had better performance on reducing expansions due to ASR. In this research, using high reactive zeolite at %20 replacement level was effective in mitigating expansions.

Keywords: alkali silica reaction, natural zeolite, durability, expansion

Procedia PDF Downloads 391

Authors: Rui Wu

Abstract:

In the volatile modern manufacturing environment, new orders randomly occur at any time, while the pre-emptive methods are infeasible. This leads to a real-time scheduling method that can produce a reasonably good schedule quickly. The dynamic Flexible Job Shop problem is an NP-hard scheduling problem that hybrid the dynamic Job Shop problem with the Parallel Machine problem. A Flexible Job Shop contains different work centres. Each work centre contains parallel machines that can process certain operations. Many algorithms, such as genetic algorithms or simulated annealing, have been proposed to solve the static Flexible Job Shop problems. However, the time efficiency of these methods is low, and these methods are not feasible in a dynamic scheduling problem. Therefore, a dynamic rule selection scheduling system based on the reinforcement learning method is proposed in this research, in which the dynamic Flexible Job Shop problem is divided into several parallel machine problems to decrease the complexity of the dynamic Flexible Job Shop problem. Firstly, the features of jobs, machines, work centres, and flexible job shops are selected to describe the status of the dynamic Flexible Job Shop problem at each decision point in each work centre. Secondly, a framework of reinforcement learning algorithm using a double-layer deep Q-learning network is applied to select proper composite dispatching rules based on the status of each work centre. Then, based on the selected composite dispatching rule, an available operation is selected from the waiting buffer and assigned to an available machine in each work centre. Finally, the proposed algorithm will be compared with well-known dispatching rules on objectives of mean tardiness, mean flow time, mean waiting time, or mean percentage of waiting time in the real-time Flexible Job Shop problem. The result of the simulations proved that the proposed framework has reasonable performance and time efficiency.

Keywords: dynamic scheduling problem, flexible job shop, dispatching rules, deep reinforcement learning

Procedia PDF Downloads 108

Authors: Carolina Silva, João Nuno Oliveira, Rui Sousa, João Paulo Silva

Abstract:

This study uses genetic algorithms to solve a job scheduling problem in a weaving factory. The underline problem regards an NP-Hard problem concerning unrelated parallel machines, with sequence-dependent setup times. This research uses real data regarding a weaving industry located in the North of Portugal, with a capacity of 96 looms and a production, on average, of 440000 meters of fabric per month. Besides, this study includes a high level of complexity once most of the real production constraints are applied, and several real data instances are tested. Topics such as data analyses and algorithm performance are addressed and tested, to offer a solution that can generate reliable and due date results. All the approaches will be tested in the operational environment, and the KPIs monitored, to understand the solution's impact on the production, with a particular focus on the total number of weeks of late deliveries to clients. Thus, the main goal of this research is to develop a solution that allows for the production of automatically optimized production plans, aiming to the tardiness minimizing.

Keywords: genetic algorithms, textile industry, job scheduling, optimization

Procedia PDF Downloads 157

Authors: Murat Erkoc, Kadir Ertogral

Abstract:

Maintenance, repair and overhauling (MRO) of high cost equipment used in many industries such as transportation, military and construction are typically subject to regulations set by local governments or international agencies. Aircrafts are prime examples for this kind of equipment. Such equipment must be overhauled at certain intervals for continuing permission of use. As such, the overhaul must be completed by strict deadlines, which often times cannot be exceeded. Due to the fact that the overhaul is typically a long process, MRO companies carry so called rotable inventory for exchange of expensive modules in the overhaul process of the equipment so that the equipment continue its services with minimal interruption. The extracted module is overhauled and returned back to the inventory for future exchange, hence the name rotable inventory. However, since the rotable inventory and overhaul capacity are limited, it may be necessary to carry out some of the exchanges earlier than their deadlines in order to produce a feasible overhaul schedule. An early exchange results with a decrease in the equipment’s cycle time in between overhauls and as such, is not desired by the equipment operators. This study introduces an integer programming model for the optimal overhaul and exchange scheduling. We assume that there is certain number of rotables at hand at the beginning of the planning horizon for a single type module and there are multiple demands with known deadlines for the exchange of the modules. We consider an MRO system with identical parallel processing lines. The model minimizes total earliness by generating optimal overhaul start times for rotables on parallel processing lines and exchange timetables for orders. We develop a fast exact solution algorithm for the model. The algorithm employs full-delay scheduling approach with backward allocation and can easily be used for overhaul scheduling problems in various MRO settings with modular rotable items. The proposed procedure is demonstrated by a case study from the aerospace industry.

Keywords: rotable inventory, full-delay scheduling, maintenance, overhaul, total earliness

Procedia PDF Downloads 544

Authors: Kuddis Büyükakıllı

Abstract:

The pretreated and bleached mercerized cotton fabric was dyed with reactive Everzol Brilliant Yellow 4GR (C.I. Yellow 160) dyestuff. Superhydrophobicity is provided to white and reactive dyed fabrics by using a nanotechnological sol-gel method with tetraethoxysilane and fluorcarbon water repellent agents by the two-step method. The effect of coating on color yield, fastness and functional properties of fabric was investigated. It was observed that water drop contact angles were higher in colorless coated fabrics compared to colored coated fabrics, there was no significant color change in colored superhydrophobic fabric and high color fastness values. Although there are no significant color losses in the fabrics after multiple washing and dry cleaning processes, water drop contact angles are greatly reduced.

Keywords: fluorcarbon water repellent agent, colored cotton fabric, sol-gel, superhydrophobic

Procedia PDF Downloads 118

Authors: El-Sayed Negim, Ainakulova D. T., Puteri S. M., Khaldun M. Azzam, Bekbayeva L. K., Arpit Goyal, Ganjian E.

Abstract:

Anticorrosion coatings protect metal surfaces from environmental factors including moisture, oxygen, and gases that caused corrosion to the metal. Various types of anticorrosion coatings are available, with different properties and application methods. Many researchers have been developing methods to prevent corrosion, and epoxy polymers are one of the wide methods due to their excellent adhesion, chemical resistance, and durability. In this study, synthesis reactive dilute based on glycidyl methacrylate (GMA) with each of 2-ethylhexyl acrylate (2-EHA) and butyl acrylate (BuA) to improve the performance of epoxy resin and anticorrosion coating. The copolymers were synthesized with composition ratio (5/5) by bulk polymerization technique using benzoyl peroxide as a catalyst and temperature at 85 oC for 2 hours and at 90 oC for 30 minutes to complete the polymerization process. The obtained copolymers were characterized by FTIR, viscosity and thixotropic index. The effect of copolymers as reactive dilute on the physical and mechanical properties of epoxy resin was investigated. Metal plates coated by the modified epoxy resins with different contents of copolymers were tested using alkali and salt test methods, and the copolymer based on GMA and BUA showed the best protection efficiency due to the barrier effect of the polymer layer.

Keywords: epoxy, coating, dilute, corrosion, reactive

Procedia PDF Downloads 52

Authors: Zahra Ahmadi, Fazlollah Adibnia

Abstract:

Scheduling of tasks and the optimal allocation of resources in the cloud are based on the dynamic nature of tasks and the heterogeneity of resources. Applications that are based on the scientific workflow are among the most widely used applications in this field, which are characterized by high processing power and storage capacity. In order to increase their efficiency, it is necessary to plan the tasks properly and select the best virtual machine in the cloud. The goals of the system are effective factors in scheduling tasks and resource selection, which depend on various criteria such as time, cost, current workload and processing power. Multi-criteria decision-making methods are a good choice in this field. In this research, a new method of work planning and resource allocation in a heterogeneous environment based on the modified AHP algorithm is proposed. In this method, the scheduling of input tasks is based on two criteria of execution time and size. Resource allocation is also a combination of the AHP algorithm and the first-input method of the first client. Resource prioritization is done with the criteria of main memory size, processor speed and bandwidth. What is considered in this system to modify the AHP algorithm Linear Max-Min and Linear Max normalization methods are the best choice for the mentioned algorithm, which have a great impact on the ranking. The simulation results show a decrease in the average response time, return time and execution time of input tasks in the proposed method compared to similar methods (basic methods).

Keywords: hierarchical analytical process, work prioritization, normalization, heterogeneous resource allocation, scientific workflow

Procedia PDF Downloads 145