Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

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

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

Platooning-based control techniques in transportation and logistic

This thesis explores the integration of autonomous vehicle technology with smart manufacturing systems. At first, essential control methods for autonomous vehicles, including Linear Matrix Inequalities (LMIs), Linear Quadratic Regulation (LQR)/Linear Quadratic Tracking (LQT), PID controllers, and dynamic control logic via flowcharts, are examined. These techniques are adapted for platooning to enhance coordination, safety, and efficiency within vehicle fleets, and various scenarios are analyzed to confirm their effectiveness in achieving predetermined performance goals such as inter-vehicle distance and fuel consumption. A first approach on simplified hardware, yet realistic to model the vehicle's behavior, is treated to further prove the theoretical results. Subsequently, performance improvement in smart manufacturing systems (SMS) is treated. The focus is placed on offline and online scheduling techniques exploiting Mixed Integer Linear Programming (MILP) to model the shop floor and Model Predictive Control (MPC) to adapt scheduling to unforeseen events, in order to understand how optimization algorithms and decision-making frameworks can transform resource allocation and production processes, ultimately improving manufacturing efficiency. In the final part of the work, platooning techniques are employed within SMS. Autonomous Guided Vehicles (AGVs) are reimagined as autonomous vehicles, grouping them within platoon formations according to different criteria, and controlled to avoid collisions while carrying out production orders. This strategic integration applies platooning principles to transform AGV logistics within the SMS. The impact of AGV platooning on key performance metrics, such as makespan, is devised, providing insights into optimizing manufacturing processes. Throughout this work, various research fields are examined, with intersecting future technologies from precise control in autonomous vehicles to the coordination of manufacturing resources. This thesis provides a comprehensive view of how optimization and automation can reshape efficiency and productivity not only in the domain of autonomous vehicles but also in manufacturing

Intelligent design of manufacturing systems.

The design of a manufacturing system is normally performed in two distinct stages, i.e. steady state design and dynamic state design. Within each system design stage a variety of decisions need to be made of which essential ones are the determination of the product range to be manufactured, the layout of equipment on the shopfloor, allocation of work tasks to workstations, planning of aggregate capacity requirements and determining the lot sizes to be processed. This research work has examined the individual problem areas listed above in order to identify the efficiency of current solution techniques and to determine the problems experienced with their use. It has been identified that for each design problem. although there are an assortment of solution techniques available, the majority of these techniques are unable to generate optimal or near optimal solutions to problems of a practical size. In addition, a variety of limitations have been identified that restrict the use of existing techniques. For example, existing methods are limited with respect to the external conditions over which they are applicable and/or cannot enable qualitative or subjective judgements of experienced personnel to influence solution outcomes. An investigation of optimization techniques has been carried out which indicated that genetic algorithms offer great potential in solving the variety of problem areas involved in manufacturing systems design. This research has, therefore, concentrated on testing the use of genetic algorithms to make individual manufacturing design decisions. In particular, the ability of genetic algorithms to generate better solutions than existing techniques has been examined and their ability to overcome the range of limitations that exist with current solution techniques. IIFor each problem area, a typical solution has been coded in terms of a genetic algorithm structure, a suitable objective function constructed and experiments performed to identify the most suitable operators and operator parameter values to use. The best solution generated using these parameters has then been compared with the solution derived using a traditional solution technique. In addition, from the range of experiments undertaken the underlying relationships have been identified between problem characteristics and optimality of operator types and parameter values. The results of the research have identified that genetic algorithms could provide an improved solution technique for all manufacturing design decision areas investigated. In most areas genetic algorithms identified lower cost solutions and overcame many of the limitations of existing techniques

Resource selection and route generation in discrete manufacturing environment

When put to various sources, the question of which sequence of operations and machines is best for producing a particular component will often receive a wide range of answers. When the factors of optimum cutting conditions, minimum time, minimum cost, and uniform equipment utilisation are added to the equation, the range of answers becomes even more extensive. Many of these answers will be 'correct', however only one can be the best or optimum solution. When a process planner chooses a route and the accompanying machining conditions for a job, he will often rely on his experience to make the choice. Clearly, a manual generation of routes does not take all the important considerations into account. The planner may not be aware of all the factors and routes available to him. A large workshop might have hundreds of possible routes, even if he did know it all', he will never be able to go through all the routes and calculate accurately which is the most suitable for each process - to do this, something faster is required. This thesis describes the design and implementation of an Intelligent Route Generator. The aim is to provide the planner with accurate calculations of all possible production routes m a factory. This will lead up to the selection of an optimum solution according to minimum cost and time. The ultimate goal will be the generation of fast decisions based on expert information. Background knowledge of machining processes and machine tools was initially required, followed by an identification of the role of the knowledge base and the database within the system. An expert system builder. Crystal, and a database software package, DBase III Plus, were chosen for the project. Recommendations for possible expansion of and improvements to the expert system have been suggested for future development