Models and Algorithms for Production Planning and Scheduling in Foundries – Current State and Development Perspectives

Mathematical programming, constraint programming and computational intelligence techniques, presented in the literature in the field of operations research and production management, are generally inadequate for planning real-life production process. These methods are in fact dedicated to solving the standard problems such as shop floor scheduling or lot-sizing, or their simple combinations such as scheduling with batching. Whereas many real-world production planning problems require the simultaneous solution of several problems (in addition to task scheduling and lot-sizing, the problems such as cutting, workforce scheduling, packing and transport issues), including the problems that are difficult to structure. The article presents examples and classification of production planning and scheduling systems in the foundry industry described in the literature, and also outlines the possible development directions of models and algorithms used in such systems

A Production Planning Model for Make-to-Order Foundry Flow Shop with Capacity Constraint

The mode of production in the modern manufacturing enterprise mainly prefers to MTO (Make-to-Order); how to reasonably arrange the production plan has become a very common and urgent problem for enterprises’ managers to improve inner production reformation in the competitive market environment. In this paper, a mathematical model of production planning is proposed to maximize the profit with capacity constraint. Four kinds of cost factors (material cost, process cost, delay cost, and facility occupy cost) are considered in the proposed model. Different factors not only result in different profit but also result in different satisfaction degrees of customers. Particularly, the delay cost and facility occupy cost cannot reach the minimum at the same time; the two objectives are interactional. This paper presents a mathematical model based on the actual production process of a foundry flow shop. An improved genetic algorithm (IGA) is proposed to solve the biobjective problem of the model. Also, the gene encoding and decoding, the definition of fitness function, and genetic operators have been illustrated. In addition, the proposed algorithm is used to solve the production planning problem of a foundry flow shop in a casting enterprise. And comparisons with other recently published algorithms show the efficiency and effectiveness of the proposed algorithm

Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem

The multi-dimensional knapsack problem (MDKP) is a well-studied problem in Decision Sciences. The problem’s NP-Hard nature prevents the successful application of exact procedures such as branch and bound, implicit enumeration and dynamic programming for larger problems. As a result, various approximate solution approaches, such as the relaxation approaches, heuristic and metaheuristic approaches have been developed and applied effectively to this problem. In this study, we propose a Neural approach, a Genetic Algorithms approach and a Neurogenetic approach, which is a hybrid of the Neural and the Genetic Algorithms approach. The Neural approach is essentially a problem-space based non-deterministic local-search algorithm. In the Genetic Algorithms approach we propose a new way of generating initial population. In the Neurogenetic approach, we show that the Neural and Genetic iterations, when interleaved appropriately, can complement each other and provide better solutions than either the Neural or the Genetic approach alone. Within the overall search, the Genetic approach provides diversification while the Neural provides intensification. We demonstrate the effectiveness of our proposed approaches through an empirical study performed on several sets of benchmark problems commonly used in the literature

Revisiting sparse dynamic programming for the 0/1 Knapsack Problem

2019 Spring.Includes bibliographical references.The 0/1-Knapsack Problem is a classic NP-hard problem. There are two common approaches to obtain the exact solution: branch-and-bound (BB) and dynamic programming (DP). A socalled, "sparse" DP algorithm (SKPDP) that performs fewer operations than the standard algorithm (KPDP) is well known. To the best of our knowledge, there has been no quantitative analysis of the benefits of sparsity. We provide a careful empirical evaluation of SKPDP and observe that for a "large enough" capacity, C, the number of operations performed by SKPDP is invariant with respect to C for many problem instances. This leads to the possibility of an exponential improvement over the conventional KPDP. We experimentally explore SKPDP over a large range of knapsack problem instances and provide a detailed study of the attributes that impact the performance. DP algorithms have a nice regular structure and are amenable to highly parallel implementations. However, due to the dependence structure, parallelizing SKPDP is challenging. We propose two parallelization strategies (fine-grain and coarse-grain) for SKPDP on modern multi-core processors and demonstrate a scalable improvement in the performance

A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem

In many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation in order to take account of their sequence-dependent setup costs and times. The amount of research in recent years indicates the relevance of this problem in various industrial settings. In this paper, facility location reformulation and strengthening constraints are newly applied to a previous lot-sizing model in order to improve solution quality and computing time. Three alternative metaheuristics are used to fix the setup variables, resulting in much improved performance over previous research, especially regarding the use of the metaheuristics for larger instances

A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems

In order to better solve discrete 0-1 knapsack problems, a novel global-best harmony search algorithm with binary coding, called DGHS, is proposed. First, an initialization based on a greedy mechanism is employed to improve the initial solution quality in DGHS. Next, we present a novel improvisation process based on intuitive cognition of improvising a new harmony, in which the best harmony of harmony memory (HM) is used to guide the searching direction of evolution during the process of memory consideration, or else a harmony is randomly chosen from HM and then a discrete genetic mutation is done with some probability during the phase of pitch adjustment. Third, a two-phase repair operator is employed to repair an infeasible harmony vector and to further improve a feasible solution. Last, a new selection scheme is applied to decide whether or not a new randomly generated harmony is included into the HM. The proposed DGHS is evaluated on twenty knapsack problems with different scales and compared with other three metaheuristics from the literature. The experimental results indicate that DGHS is efficient, effective, and robust for solving difficult 0-1 knapsack problems

Task Packing: Efficient task scheduling in unbalanced parallel programs to maximize CPU utilization

Load imbalance in parallel systems can be generated by external factors to the currently running applications like operating system noise or the underlying hardware like a heterogeneous cluster. HPC applications working on irregular data structures can also have difficulties to balance their computations across the parallel tasks. In this article we extend, improve and evaluate more deeply the Task Packing mechanism proposed in a previous work. The main idea of the mechanism is to concentrate the idle cycles of unbalanced applications in such a way that one or more CPUs are freed from execution. To achieve this, CPUs are stressed with just useful work of the parallel application tasks, provided performance is not degraded. The packing is solved by an algorithm based on the Knapsack problem, in a minimum number of CPUs and using oversubscription. We design and implement a more efficient version of such mechanism. To that end, we perform the Task Packing “in place”, taking advantage of idle cycles generated at synchronization points of unbalanced applications. Evaluations are carried out on a heterogeneous platform using FT and miniFE benchmarks. Results showed that our proposal generates low overhead. In addition the amount of freed CPUs are related to a load imbalance metric which can be used as a prediction for it.Peer ReviewedPostprint (author's final draft

Quality-of-Service-Aware Service Selection in Mobile Environments

The last decade is characterized by the rise of mobile technologies (UMTS, LTE, WLAN, Bluetooth, SMS, etc.) and devices (notebooks, tablets, mobile phones, smart watches, etc.). In this rise, mobiles phones have played a crucial role because they paved the way for mobile pervasion among the public. In addition, this development has also led to a rapid growth of the mobile service/application market (Statista 2017b). As a consequence, users of mobile devices nowadays find themselves in a mobile environment, with (almost) unlimited access to information and services from anywhere through the Internet, and can connect to other people at any time (cf. Deng et al. 2016; Newman 2015). Additionally, modern mobile devices offer the opportunity to select the services or information that best fit to a user’s current context. In this regard, mobile information services support users in retrieving context and non-context information, such as about the current traffic situation, public transport options, and flight connections, as well as about real-world entities, such as sights, museums, and restaurants (cf. Deng et al. 2016; Heinrich and Lewerenz 2015; Ventola 2014). An example of the application of mobile information services is several users planning a joint city day trip. Here, the users could utilize information retrieved about real-world entities for their planning. Such a trip constitutes a process with multiple participating users and may encompass actions such as visiting a museum and having lunch. For each action, mobile information services (e.g., Yelp, TripAdvisor, Google Places) can help locate available alternatives that differ only in attributes such as price, average length of stay (i.e., duration), or recommendations published by previous visitors. In addition, context information (e.g., business hours, distance) can be used to more effectively support the users in their decisions. Moreover, because multiple users are participating in the same trip, some users want to or must conduct certain actions together. However, decision-makers (e.g., mobile users) attempting to determine the optimal solution for such processes – meaning the best alternative for each action and each participating user – are confronted with several challenges, as shown by means of the city trip example: First, each user most likely has his or her own preferences and requirements regarding attributes such as price and duration, which all must be considered. Furthermore, for each action of the day trip, a huge number of alternatives probably exist. Thus, users might face difficulties selecting the optimal alternatives because of an information overload problem (Zhang et al. 2009). Second, taking multiple users into account may require the coordination of their actions because of potential dependencies among different users’ tours, which, for example, is the case when users prefer to conduct certain actions together. This turns the almost sophisticated decision problem at hand into a problem of high complexity. The problem complexity is increased further when considering context information, because this causes dependencies among different actions of a user that must be taken into account. For instance, the distance to cover by a user to reach a certain restaurant depends on the location of the previously visited museum. In conclusion, it might be impossible for a user to determine an optimal city trip tour for all users, making decision support by an information system necessary. Because the available alternatives for each action of the process can be denoted as (information) service objects (cf. Dannewitz et al. 2008; Heinrich and Lewerenz 2015; Hinkelmann et al. 2013), the decision problem at hand is a Quality-of-Service (QoS)-aware service selection problem. This thesis proposes novel concepts and optimization approaches for QoS-aware service selection regarding processes with multiple users and context information, focusing on scenarios in mobile environments. In this respect, the developed multi user context-aware service selection approaches are able to deal with dependencies among different users’ service compositions, which result from the consideration of multiple users, as well as dependencies within a user’s service composition, which result from the consideration of context information. Consequently, these approaches provide suitable support for decision-makers, such as mobile users

Management, Technology and Learning for Individuals, Organisations and Society in Turbulent Environments

This book presents the collection of fifty two papers which were presented on the First International Conference on BUSINESS SUSTAINABILITY ’08 - Management, Technology and Learning for Individuals, Organisations and Society in Turbulent Environments, held in Ofir, Portugal, from 25th to 27th of June, 2008. The main motive of the meeting was the growing awareness of the importance of the sustainability issue. This importance had emerged from the growing uncertainty of the market behaviour that leads to the characterization of the market, i.e. environment, as turbulent. Actually, the characterization of the environment as uncertain and turbulent reflects the fact that the traditional technocratic and/or socio-technical approaches cannot effectively and efficiently lead with the present situation. In other words, the rise of the sustainability issue means the quest for new instruments to deal with uncertainty and/or turbulence. The sustainability issue has a complex nature and solutions are sought in a wide range of domains and instruments to achieve and manage it. The domains range from environmental sustainability (referring to natural environment) through organisational and business sustainability towards social sustainability. Concerning the instruments for sustainability, they range from traditional engineering and management methodologies towards “soft” instruments such as knowledge, learning, creativity. The papers in this book address virtually whole sustainability problems space in a greater or lesser extent. However, although the uncertainty and/or turbulence, or in other words the dynamic properties, come from coupling of management, technology, learning, individuals, organisations and society, meaning that everything is at the same time effect and cause, we wanted to put the emphasis on business with the intention to address primarily the companies and their businesses. From this reason, the main title of the book is “Business Sustainability” but with the approach of coupling Management, Technology and Learning for individuals, organisations and society in Turbulent Environments. Concerning the First International Conference on BUSINESS SUSTAINABILITY, its particularity was that it had served primarily as a learning environment in which the papers published in this book were the ground for further individual and collective growth in understanding and perception of sustainability and capacity for building new instruments for business sustainability. In that respect, the methodology of the conference work was basically dialogical, meaning promoting dialog on the papers, but also including formal paper presentations. In this way, the conference presented a rich space for satisfying different authors’ and participants’ needs. Additionally, promoting the widest and global learning environment and participativeness, the Conference Organisation provided the broadcasting over Internet of the Conference sessions, dialogical and formal presentations, for all authors’ and participants’ institutions, as an innovative Conference feature. In these terms, this book could also be understood as a complementary instrument to the Conference authors’ and participants’, but also to the wider readerships’ interested in the sustainability issues. The book brought together 97 authors from 10 countries, namely from Australia, Finland, France, Germany, Ireland, Portugal, Russia, Serbia, Sweden and United Kingdom. The authors “ranged” from senior and renowned scientists to young researchers providing a rich and learning environment. At the end, the editors hope and would like that this book will be useful, meeting the expectation of the authors and wider readership and serving for enhancing the individual and collective learning, and to incentive further scientific development and creation of new papers. Also, the editors would use this opportunity to announce the intention to continue with new editions of the conference and subsequent editions of accompanying books on the subject of BUSINESS SUSTAINABILITY, the second of which is planned for year 2011.info:eu-repo/semantics/publishedVersio

Implementación de un algoritmo memético para optimizar la carga de hornos para la producción de sanitarios

La continua competencia entre las empresas del sector fabricación de cerámicos y sanitarios ha hecho que estas busquen mejorar su calidad y su eficiencia, en el proceso productivo, para aumentar sus ganancias y reducir pérdidas. Una de las formas en que esto se ha manifestado es mediante el uso de soluciones informáticas. Sin embargo, aunque estas se enfocan en varios aspectos como la gestión de personal, almacenes, registros de ventas, entre otros, dejan un vacío en la optimización de las etapas del proceso de fabricación en sí. Tal es el caso de la fase de cocción, que tiene una larga duración y carece de una estrategia para la selección óptima de piezas que serán cargadas en el horno, ocasionando un cuello de botella en el proceso. La variedad de modelos a elaborar, la cantidad de piezas que los componen, los colores, así como la demanda, las restricciones de peso y volumen (de las vagonetas y hornos), dificultan la selección de piezas. Este problema no solo se presenta en el sector fabricación de sanitarios, sino también en otros, donde se manufacturan y ensamblan productos compuestos por varias partes, razón por la cual se han realizado varias investigaciones para desarrollar soluciones basadas en algoritmos que generen buenos resultados en tiempos razonables. La clase de algoritmos más usados en estos casos son los metaheurísticos y, dentro de esta categoría, el algoritmo genético debido a su simplicidad. Sin embargo, en investigaciones recientes se ha visto que los algoritmos meméticos generan buenas soluciones en un número menor de evaluaciones y con mejor calidad. Tomando en cuenta lo mencionado anteriormente, este proyecto de fin de carrera tuvo como objetivo: diseñar e implementar un algoritmo memético que genere una selección de piezas priorizando aquellas que aprovechen la capacidad de peso y volumen de hornos y vagonetas, considerando la demanda de los sets de productos. Este algoritmo luego fue calibrado para mejorarlo y finalmente se lo comparó con el algoritmo genético para determinar cuál de ellos es el mejor para este tipo de problemas.Tesi