798 research outputs found
Overview on: sequencing in mixed model flowshop production line with static and dynamic context
In the present work a literature overview was given on solution techniques considering basic as well as more advanced and consequently more complex arrangements of mixed model flowshops. We first analyzed the occurrence of setup time/cost; existing solution techniques are mainly focused on permutation sequences. Thereafter we discussed objectives resulting in the introduction of variety of methods allowing resequencing of jobs within the line. The possibility of resequencing within the line ranges from 1) offline or intermittent buffers, 2) parallel stations, namely flexible, hybrid or compound flowshops, 3) merging and splitting of parallel lines, 4) re-entrant flowshops, to 5) change job attributes without physically interchanging the position.
In continuation the differences in the consideration of static and dynamic demand was studied. Also intermittent setups are possible, depending on the horizon and including the possibility of resequencing, four problem cases were highlighted: static, semi dynamic, nearly dynamic and dynamic case.
Finally a general overview was given on existing solution methods, including exact and approximation methods. The approximation methods are furthermore divided in two cases, know as heuristics and methaheuristic
Balancing and lot-sizing mixed-model lines in the footwear industry
This report describes the full research proposal for the project \Balancing and lot-sizing mixed-model lines in the footwear industry", to be developed as part of the master program in Engenharia Electrotécnica e de Computadores - Sistemas de Planeamento Industrial of the Instituto Superior de Engenharia do Porto. The Portuguese footwear industry is undergoing a period of great development and innovation. The numbers speak for themselves, Portugal footwear exported 71 million pairs of shoes to over 130 countries in 2012. It is a diverse sector, which covers different categories of women, men and children shoes, each of them with various models. New and technologically advanced mixed-model assembly lines are being projected and installed to replace traditional mass assembly lines. Obviously there is a need to manage them conveniently and to improve their operations. This work focuses on balancing and lot-sizing stitching mixed-model lines in a real world environment. For that purpose it will be fundamental to develop and evaluate adequate effective solution methods. Different objectives may be considered, which are relevant for the companies, such as minimizing the number of workstations, and minimizing the makespan, while taking into account a lot of practical restrictions. The solution approaches will be based on approximate methods, namely by resorting to metaheuristics. To show the impact of having different lots in production the initial maximum amount for each lot is changed and a Tabu Search based procedure is used to improve the solutions. The developed approaches will be evaluated and tested. A special attention will be given to the solution of real applied problems. Future work may include the study of other neighbourhood structures related to Tabu Search and the development of ways to speed up the evaluation of neighbours, as well as improving the balancing solution method
A Benchmark Environment Motivated by Industrial Control Problems
In the research area of reinforcement learning (RL), frequently novel and
promising methods are developed and introduced to the RL community. However,
although many researchers are keen to apply their methods on real-world
problems, implementing such methods in real industry environments often is a
frustrating and tedious process. Generally, academic research groups have only
limited access to real industrial data and applications. For this reason, new
methods are usually developed, evaluated and compared by using artificial
software benchmarks. On one hand, these benchmarks are designed to provide
interpretable RL training scenarios and detailed insight into the learning
process of the method on hand. On the other hand, they usually do not share
much similarity with industrial real-world applications. For this reason we
used our industry experience to design a benchmark which bridges the gap
between freely available, documented, and motivated artificial benchmarks and
properties of real industrial problems. The resulting industrial benchmark (IB)
has been made publicly available to the RL community by publishing its Java and
Python code, including an OpenAI Gym wrapper, on Github. In this paper we
motivate and describe in detail the IB's dynamics and identify prototypic
experimental settings that capture common situations in real-world industry
control problems
A Benchmark Environment Motivated by Industrial Control Problems
In the research area of reinforcement learning (RL), frequently novel and
promising methods are developed and introduced to the RL community. However,
although many researchers are keen to apply their methods on real-world
problems, implementing such methods in real industry environments often is a
frustrating and tedious process. Generally, academic research groups have only
limited access to real industrial data and applications. For this reason, new
methods are usually developed, evaluated and compared by using artificial
software benchmarks. On one hand, these benchmarks are designed to provide
interpretable RL training scenarios and detailed insight into the learning
process of the method on hand. On the other hand, they usually do not share
much similarity with industrial real-world applications. For this reason we
used our industry experience to design a benchmark which bridges the gap
between freely available, documented, and motivated artificial benchmarks and
properties of real industrial problems. The resulting industrial benchmark (IB)
has been made publicly available to the RL community by publishing its Java and
Python code, including an OpenAI Gym wrapper, on Github. In this paper we
motivate and describe in detail the IB's dynamics and identify prototypic
experimental settings that capture common situations in real-world industry
control problems
Applied Metaheuristic Computing
For decades, Applied Metaheuristic Computing (AMC) has been a prevailing optimization technique for tackling perplexing engineering and business problems, such as scheduling, routing, ordering, bin packing, assignment, facility layout planning, among others. This is partly because the classic exact methods are constrained with prior assumptions, and partly due to the heuristics being problem-dependent and lacking generalization. AMC, on the contrary, guides the course of low-level heuristics to search beyond the local optimality, which impairs the capability of traditional computation methods. This topic series has collected quality papers proposing cutting-edge methodology and innovative applications which drive the advances of AMC
Recommended from our members
Global supply chain optimization: a machine learning perspective to improve caterpillar's logistics operations
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.Supply chain optimization is one of the key components for the effective management of a company with a complex manufacturing process and distribution network. Companies with a global presence in particular are motivated to optimize their distribution plans in order to keep their operating costs low and competitive. Changing condition in the global market and volatile energy prices increase the need for an automatic decision and optimization tool. In recent years, many techniques and applications have been proposed to address the
problem of supply chain optimization. However, such techniques are often too problemspecific or too knowledge-intensive to be implemented as in-expensive, and easy-to-use computer system. The effort required to implement an optimization system for a new instance of the problem appears to be quite significant. The development process necessitates the involvement of expert personnel and the level of automation is low. The aim of this project is to develop a set of strategies capable of increasing the level of
automation when developing a new optimization system. An increased level of automation is achieved by focusing on three areas: multi-objective optimization, optimization algorithm usability, and optimization model design. A literature review highlighted the great level of interest for the problem of multiobjective optimization in the research community. However, the review emphasized a lack of standardization in the area and insufficient understanding of the relationship between multi-objective strategies and problems. Experts in the area of optimization and artificial intelligence are interested in improving the usability of the most recent
optimization algorithms. They stated the concern that the large number of variants and parameters, which characterizes such algorithms, affect their potential applicability in real-world environments. Such characteristics are seen as the root cause for the low success of the most recent optimization algorithms in industrial applications. Crucial task for the development of an optimization system is the design of the optimization model. Such task is one of the most complex in the development process, however, it is still performed mostly manually. The importance and the complexity of the task strongly suggest the development of tools to aid the design of optimization models. In order to address such challenges, first the problem of multi-objective optimization is considered and the most widely adopted techniques to solve it are identified. Such techniques are analyzed and described in details to increase the level of standardization in the area. Empirical evidences are highlighted to suggest what type of relationship exists between strategies and problem instances. Regarding the optimization algorithm, a classification method is proposed to improve its usability and computational requirement by automatically tuning one of its key parameters, the termination condition. The algorithm understands the problem complexity and automatically assigns the best termination condition to minimize runtime. The runtime of the optimization system has been reduced by more than 60%. Arguably, the usability of the algorithm has been improved as well, as one of the key configuration tasks can now be completed automatically. Finally, a system is presented to aid the definition of the optimization model through regression analysis. The purpose of the method is to gather as much knowledge about the problem as possible so that the task of the optimization model definition requires a lower user involvement. The application of the proposed algorithm is estimated that could have saved almost 1000 man-weeks to complete the project. The developed strategies have been applied to the problem of Caterpillar’s global supply chain optimization. This thesis describes also the process of developing an optimization system for Caterpillar and highlights the challenges and research opportunities identified while undertaking this work. This thesis describes the optimization model designed for Caterpillar’s supply chain and the implementation details of the Ant Colony System, the algorithm selected to optimize the supply chain. The system is now used to design the distribution plans of more than 7,000 products. The system improved Caterpillar’s marginal profit on such products by a factor of 4.6% on average.Caterpillar Inc
Assembly Line
An assembly line is a manufacturing process in which parts are added to a product in a sequential manner using optimally planned logistics to create a finished product in the fastest possible way. It is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The present edited book is a collection of 12 chapters written by experts and well-known professionals of the field. The volume is organized in three parts according to the last research works in assembly line subject. The first part of the book is devoted to the assembly line balancing problem. It includes chapters dealing with different problems of ALBP. In the second part of the book some optimization problems in assembly line structure are considered. In many situations there are several contradictory goals that have to be satisfied simultaneously. The third part of the book deals with testing problems in assembly line. This section gives an overview on new trends, techniques and methodologies for testing the quality of a product at the end of the assembling line
Problem dependent metaheuristic performance in Bayesian network structure learning.
Bayesian network (BN) structure learning from data has been an active research area in the machine learning field in recent decades. Much of the research has considered BN structure learning as an optimization problem. However, the finding of optimal BN from data is NP-hard. This fact has driven the use of heuristic algorithms for solving this kind of problem. Amajor recent focus in BN structure learning is on search and score algorithms. In these algorithms, a scoring function is introduced and a heuristic search algorithm is used to evaluate each network with respect to the training data. The optimal network is produced according to the best score evaluated. This thesis investigates a range of search and score algorithms to understand the relationship between technique performance and structure features of the problems. The main contributions of this thesis include (a) Two novel Ant Colony Optimization based search and score algorithms for BN structure learning; (b) Node juxtaposition distribution for studying the relationship between the best node ordering and the optimal BN structure; (c) Fitness landscape analysis for investigating the di erent performances of both chain score function and the CH score function; (d) A classifier method is constructed by utilizing receiver operating characteristic curve with the results on fitness landscape analysis; and finally (e) a selective o -line hyperheuristic algorithm is built for unseen BN structure learning with search and score algorithms. In this thesis, we also construct a new algorithm for producing BN benchmark structures and apply our novel approaches to a range of benchmark problems and real world problem
The discovery of genes that exhibit strong effects on metastatic pancreatic cancer
Pancreatic cancer is one of the deadliest cancers. Alterations in gene expression play an essential role during disease development. Also, variations in gene expression are involved in metastasis. Due to the complexity of gene expression alterations, however, it is still challenging to pinpoint and thus possibly target the functional reason behind the aggressiveness of pancreatic cancer. A high-throughput screening was conducted using the CRISPR-Cas9 whole- genome screening strategy to discover genes that might be essential for metastasis, to define processes that may have the potential to affect the metastatic progression of pancreatic cancer. Whole-genome CRISPR-Cas9 screening was conducted in two cell lines from the same parental cells but with different metastatic potential: S2-007 (highly metastatic) and S2-028 (lowly metastatic). The screening was performed, and samples were analyzed by MAGeCK analysis to select candidate genes. TYMS, MEN1, MYBL2 were selected based on their gene essentiality. In vitro validation was then conducted to confirm the gene essentiality in both cell lines. Cell proliferation, cell viability, soft agar colony formation assay was performed to narrow down the candidate. In vitro validation, MYBL2 showed the most promising potential as an essential gene in the metastatic pancreatic cancer cell. Wound healing assay and invasion assay were done to further validate MYBL2. Next, KEGG pathway analysis and Ingenuity analysis showed that MYBL2 interactions mainly in cell cycle network.
Further experiments were performed which focused more on the effect of MYBL2 knockout in the cell cycle. FOXM1 gene knockout was then added to the experiments since FOXM1 plays a role in the G2/M phase. The double transduction was done, followed by cell sorting. Sorted cells were then cultured, and cell viability assay and cell cycle assay were performed. All knockouts were validated using Western blot.
MYBL2 knockout showed inhibition in cell proliferation, cell viability, and soft agar colony formation assay in the S2-007 cell line. In addition, MYBL2 loss also showed invasion inhibition in S2-007. The double knockout FOXM1-MYBL2 affects cell viability more than the FOXM1 or MYBL2 single knockout. The cell cycle assay results demonstrated that the FOXM1- MYBL2, FOXM1, and MYBL2 knockout showed cell cycle arrest at G2/M in S2-007. Altogether the results showed that MYBL2 showed potential as an essential gene in the high metastatic pancreatic cancer cell line. However, the mechanism and the reason why MYBL2 showed essentiality only in the S2-007 cell line is still unclear. Therefore, more experiments still need to be conducted to achieve the goal of further elucidating the role of MYBL2 in metastatic pancreatic cancer
A research survey: review of flexible job shop scheduling techniques
In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to hybrid techniques have been used in this research. The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution. The paper comprises evaluation of publications and research methods used in various research papers. Finally, conclusions are drawn based on performed survey results. A total of 404 distinct publications were found addressing the FJSSP. Some of the research papers presented more than one technique/algorithm to solve the problem that is categorized into 410 different applications. Selected time period of these research papers is between 1990 and February 2014. Articles were searched mainly on major databases such as SpringerLink, Science Direct, IEEE Xplore, Scopus, EBSCO, etc. and other web sources. All databases were searched for “flexible job shop” and “scheduling” in the title an
- …