22 research outputs found

    General advanced job shop scheduling approach

    Get PDF
    The development of this thesis aims to design a new approach for solving production planning and scheduling in the process industries in such a way to be adaptable to any manufacturing plant, the description of which would have to be previously provided together with a series of ordered jobs. The planning and scheduling solving is concerned with the allocation over time of scarce resources between competing activities to meet a given set of requirements with an efficient organization. But, things get complicated as larger the scale of the problem is, i.e. as more resources, activities and requirements are involved. That is why the orientation of the work is focused on an innovative method in the style of Artificial Intelligence, by means of an automated process seeking to converge to a predefined objective. Although this research object has been studied since the middle of the last century, major breakthroughs were not achieved until the emergence of high-performance computing technologies; since by nature these are combinatorial problems which, the larger the scale, the more exploration they require to find some optimal. In addition, most of the last years related articles has been focused on solution approaches based on mathematical programming techniques, and it is important to note that there are other solution methods for dealing with this kind of problems. These methods can be used either as alternative methods, or as methods that can be combined with mathematical programming models, like the one proposed in this documen

    A Constraint-based Job-Shop Scheduling Model for Software Development Planning

    Get PDF
    This paper proposes a constraint-based model for the Job Shop Scheduling Problem to be solved using local search techniques. The model can be used to represent a multiple software process planning problem when the different (activities of) projects compete for limited sta®. The main aspects of the model are: the use of integer variables which represent the relative order of the operations to be scheduled, and two global constraints, all different and increasing, for ensuring feasibility. An interesting property of the model is that cycle detection in the sched- ules is implicit in the satisfaction of the constraints. In order to test the proposed model, a parameterized local search algorithm has been used, with a neighborhood similar to the Nowicki and Smutnicki one, which has been adapted in order to be suitable for the proposed model.Ministerio de Educación y Ciencia DIP2006-15476-C02-0

    Discrete particle swarm optimization for combinatorial problems with innovative applications.

    Get PDF
    Master of Science in Computer Science. University of KwaZulu-Natal, Durban 2016.Abstract available in PDF file

    Job Shop Scheduling with Flexible Maintenance Planning

    Get PDF
    This thesis considers the scheduling challenges encountered at a particular facility in the nuclear industry. The scheduling problem is modelled as a variant of the job shop scheduling problem. Important aspects of the considered problem include the scheduling of jobs with both soft and hard due dates, and the integration of maintenance planning with job scheduling. Two variants of the scheduling problem are considered: The first variant makes the classic job shop assumption of infinite queueing capacity at each machine, while such queueing capacity is non-existent in the second variant. Without queueing capacity, the scheduling problem is a variant of the blocking job shop problem. For the non-blocking variant of the problem, it is shown that good solutions can be obtained quickly by hybridising a novel Ant Colony Optimisation method with a novel Branch and Bound method. For the blocking variant of the problem, it is shown that a novel Branch and Bound method can rapidly find optimal solutions. This Branch and Bound method is shown to provide good performance due to, amongst other things, a novel search strategy and a novel branching strategy

    Production Scheduling

    Get PDF
    Generally speaking, scheduling is the procedure of mapping a set of tasks or jobs (studied objects) to a set of target resources efficiently. More specifically, as a part of a larger planning and scheduling process, production scheduling is essential for the proper functioning of a manufacturing enterprise. This book presents ten chapters divided into five sections. Section 1 discusses rescheduling strategies, policies, and methods for production scheduling. Section 2 presents two chapters about flow shop scheduling. Section 3 describes heuristic and metaheuristic methods for treating the scheduling problem in an efficient manner. In addition, two test cases are presented in Section 4. The first uses simulation, while the second shows a real implementation of a production scheduling system. Finally, Section 5 presents some modeling strategies for building production scheduling systems. This book will be of interest to those working in the decision-making branches of production, in various operational research areas, as well as computational methods design. People from a diverse background ranging from academia and research to those working in industry, can take advantage of this volume

    An Adaptive Simulation-based Decision-Making Framework for Small and Medium sized Enterprises

    Get PDF
    Abstract The rapid development of key mobile technology supporting the ‘Internet of Things’, such as 3G, Radio Frequency Identification (RFID), and Zigbee etc. and the advanced decision making methods have improved the Decision-Making System (DMS) significantly in the last decade. Advanced wireless technology can provide a real-time data collection to support DMS and the effective decision making techniques based on the real-time data can improve Supply Chain (SC) efficiency. However, it is difficult for Small and Medium sized Enterprises (SMEs) to effectively adopt this technology because of the complexity of technology and methods, and the limited resources of SMEs. Consequently, a suitable DMS which can support effective decision making is required in the operation of SMEs in SCs. This thesis conducts research on developing an adaptive simulation-based DMS for SMEs in the manufacturing sector. This research is to help and support SMEs to improve their competitiveness by reducing costs, and reacting responsively, rapidly and effectively to the demands of customers. An adaptive developed framework is able to answer flexible ‘what-if’ questions by finding, optimising and comparing solutions under the different scenarios for supporting SME-managers to make efficient and effective decisions and more customer-driven enterprises. The proposed framework consists of simulation blocks separated by data filter and convert layers. A simulation block may include cell simulators, optimisation blocks, and databases. A cell simulator is able to provide an initial solution under a special scenario. An optimisation block is able to output a group of optimum solutions based on the initial solution for decision makers. A two-phase optimisation algorithm integrated Conflicted Key Points Optimisation (CKPO) and Dispatching Optimisation Algorithm (DOA) is proposed for the condition of Jm|STsi,b with Lot-Streaming (LS). The feature of the integrated optimisation algorithm is demonstrated using a UK-based manufacture case study. Each simulation block is a relatively independent unit separated by the relevant data layers. Thus SMEs are able to design their simulation blocks according to their requirements and constraints, such as small budgets, limited professional staff, etc. A simulation block can communicate to the relative simulation block by the relevant data filter and convert layers and this constructs a communication and information network to support DMSs of Supply Chains (SCs). Two case studies have been conducted to validate the proposed simulation framework. An SME which produces gifts in a SC is adopted to validate the Make To Stock (MTS) production strategy by a developed stock-driven simulation-based DMS. A schedule-driven simulation-based DMS is implemented for a UK-based manufacturing case study using the Make To Order (MTO) production strategy. The two simulation-based DMSs are able to provide various data to support management decision making depending on different scenarios

    Holistic, data-driven, service and supply chain optimisation: linked optimisation.

    Get PDF
    The intensity of competition and technological advancements in the business environment has made companies collaborate and cooperate together as a means of survival. This creates a chain of companies and business components with unified business objectives. However, managing the decision-making process (like scheduling, ordering, delivering and allocating) at the various business components and maintaining a holistic objective is a huge business challenge, as these operations are complex and dynamic. This is because the overall chain of business processes is widely distributed across all the supply chain participants; therefore, no individual collaborator has a complete overview of the processes. Increasingly, such decisions are automated and are strongly supported by optimisation algorithms - manufacturing optimisation, B2B ordering, financial trading, transportation scheduling and allocation. However, most of these algorithms do not incorporate the complexity associated with interacting decision-making systems like supply chains. It is well-known that decisions made at one point in supply chains can have significant consequences that ripple through linked production and transportation systems. Recently, global shocks to supply chains (COVID-19, climate change, blockage of the Suez Canal) have demonstrated the importance of these interdependencies, and the need to create supply chains that are more resilient and have significantly reduced impact on the environment. Such interacting decision-making systems need to be considered through an optimisation process. However, the interactions between such decision-making systems are not modelled. We therefore believe that modelling such interactions is an opportunity to provide computational extensions to current optimisation paradigms. This research study aims to develop a general framework for formulating and solving holistic, data-driven optimisation problems in service and supply chains. This research achieved this aim and contributes to scholarship by firstly considering the complexities of supply chain problems from a linked problem perspective. This leads to developing a formalism for characterising linked optimisation problems as a model for supply chains. Secondly, the research adopts a method for creating a linked optimisation problem benchmark by linking existing classical benchmark sets. This involves using a mix of classical optimisation problems, typically relating to supply chain decision problems, to describe different modes of linkages in linked optimisation problems. Thirdly, several techniques for linking supply chain fragmented data have been proposed in the literature to identify data relationships. Therefore, this thesis explores some of these techniques and combines them in specific ways to improve the data discovery process. Lastly, many state-of-the-art algorithms have been explored in the literature and these algorithms have been used to tackle problems relating to supply chain problems. This research therefore investigates the resilient state-of-the-art optimisation algorithms presented in the literature, and then designs suitable algorithmic approaches inspired by the existing algorithms and the nature of problem linkages to address different problem linkages in supply chains. Considering research findings and future perspectives, the study demonstrates the suitability of algorithms to different linked structures involving two sub-problems, which suggests further investigations on issues like the suitability of algorithms on more complex structures, benchmark methodologies, holistic goals and evaluation, processmining, game theory and dependency analysis

    A constraint-based approach for assessing the capabilities of existing designs to handle product variation

    Get PDF
    All production machinery is designed with an inherent capability to handle slight variations in product. This is initially achieved by simply providing adjustments to allow, for example, changes that occur in pack sizes to be accommodated, through user settings or complete sets of change parts. By the appropriate use of these abilities most variations in product can be handled. However when extreme conditions of setups, major changes in product size and configuration, are considered there is no guarantee that the existing machines are able to cope. The problem is even more difficult to deal with when completely new product families are proposed to be made on an existing product line. Such changes in product range are becoming more common as producers respond to demands for ever increasing customization and product differentiation. An issue exists due to the lack of knowledge on the capabilities of the machines being employed. This often forces the producer to undertake a series of practical product trials. These however can only be undertaken once the product form has been decided and produced in sufficient numbers. There is then little opportunity to make changes that could greatly improve the potential output of the line and reduce waste. There is thus a need for a supportive modelling approach that allows the effect of variation in products to be analyzed together with an understanding of the manufacturing machine capability. Only through their analysis and interaction can the capabilities be fully understood and refined to make production possible. This thesis presents a constraint-based approach that offers a solution to the problems above. While employing this approach it has been shown that, a generic process can be formed to identify the limiting factors (constraints) of variant products to be processed. These identified constraints can be mapped to form the potential limits of performance for the machine. The limits of performance of a system (performance envelopes) can be employed to assess the design capability to cope with product variation. The approach is successfully demonstrated on three industrial case studies.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

    A constraint-based approach for assessing the capabilities of existing designs to handle product variation

    Get PDF
    All production machinery is designed with an inherent capability to handle slight variations in product. This is initially achieved by simply providing adjustments to allow, for example, changes that occur in pack sizes to be accommodated, through user settings or complete sets of change parts. By the appropriate use of these abilities most variations in product can be handled. However when extreme conditions of setups, major changes in product size and configuration, are considered there is no guarantee that the existing machines are able to cope. The problem is even more difficult to deal with when completely new product families are proposed to be made on an existing product line. Such changes in product range are becoming more common as producers respond to demands for ever increasing customization and product differentiation. An issue exists due to the lack of knowledge on the capabilities of the machines being employed. This often forces the producer to undertake a series of practical product trials. These however can only be undertaken once the product form has been decided and produced in sufficient numbers. There is then little opportunity to make changes that could greatly improve the potential output of the line and reduce waste. There is thus a need for a supportive modelling approach that allows the effect of variation in products to be analyzed together with an understanding of the manufacturing machine capability. Only through their analysis and interaction can the capabilities be fully understood and refined to make production possible. This thesis presents a constraint-based approach that offers a solution to the problems above. While employing this approach it has been shown that, a generic process can be formed to identify the limiting factors (constraints) of variant products to be processed. These identified constraints can be mapped to form the potential limits of performance for the machine. The limits of performance of a system (performance envelopes) can be employed to assess the design capability to cope with product variation. The approach is successfully demonstrated on three industrial case studies.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
    corecore