Algorithms for Scheduling Problems

This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more

Intelligent shop scheduling for semiconductor manufacturing

Semiconductor market sales have expanded massively to more than 200 billion dollars annually accompanied by increased pressure on the manufacturers to provide higher quality products at lower cost to remain competitive. Scheduling of semiconductor manufacturing is one of the keys to increasing productivity, however the complexity of manufacturing high capacity semiconductor devices and the cost considerations mean that it is impossible to experiment within the facility. There is an immense need for effective decision support models, characterizing and analyzing the manufacturing process, allowing the effect of changes in the production environment to be predicted in order to increase utilization and enhance system performance. Although many simulation models have been developed within semiconductor manufacturing very little research on the simulation of the photolithography process has been reported even though semiconductor manufacturers have recognized that the scheduling of photolithography is one of the most important and challenging tasks due to complex nature of the process. Traditional scheduling techniques and existing approaches show some benefits for solving small and medium sized, straightforward scheduling problems. However, they have had limited success in solving complex scheduling problems with stochastic elements in an economic timeframe. This thesis presents a new methodology combining advanced solution approaches such as simulation, artificial intelligence, system modeling and Taguchi methods, to schedule a photolithography toolset. A new structured approach was developed to effectively support building the simulation models. A single tool and complete toolset model were developed using this approach and shown to have less than 4% deviation from actual production values. The use of an intelligent scheduling agent for the toolset model shows an average of 15% improvement in simulated throughput time and is currently in use for scheduling the photolithography toolset in a manufacturing plant

Production Scheduling

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

Réduction du comportement myope dans le contrôle des FMS : une approche semi-hétérarchique basée sur la simulation-optimisation

Heterarchical-based control for flexible manufacturing systems (FMS) localizes control capabilities in decisional entities (DE), resulting in highly reactive and low complex control architectures. However, these architectures present myopic behavior since DEs have limited visibility of other DEs and their behavior, making difficult to ensure certain global performance. This dissertation focuses on reducing myopic behavior. At first, a definition and a typology of myopic behavior in FMS is proposed. In this thesis, myopic behavior is dealt explicitly so global performance can be improved. Thus, we propose a semi-heterarchical architecture in which a global decisional entity (GDE) deals with different kinds of myopic decisions using simulation-based optimization (SbOs). Different optimization techniques can be used so myopic decisions can be dealt individually, favoring GDE modularity. Then, the SbOs can adopt different roles, being possible to reduce myopic behavior in different ways. More, it is also possible to grant local decisional entities with different autonomy levels by applying different interaction modes. In order to balance reactivity and global performance, our approach accepts configurations in which some myopic behaviors are reduced and others are accepted. Our approach was instantiated to control the assembly cell at Valenciennes AIPPRIMECA center. Simulation results showed that the proposed architecture reduces myopic behavior whereby it strikes a balance between reactivity and global performance. The real implementation on the assembly cell verified the effectiveness of our approach under realistic dynamic scenarios, and promising results were obtained.Le contrôle hétérarchique des systèmes de production flexibles (FMS) préconise un contrôle peu complexe et hautement réactif supporté par des entités décisionnelles locales (DEs). En dépit d'avancées prometteuses, ces architectures présentent un comportement myope car les DEs ont une visibilité informationnelle limitée sue les autres DEs, ce qui rend difficile la garantie d'une performance globale minimum. Cette thèse se concentre sur les approches permettant de réduire cette myopie. D'abord, une définition et une typologie de cette myopie dans les FMS sont proposées. Ensuite, nous proposons de traiter explicitement le comportement myope avec une architecture semi-hétérarchique. Dans celle-ci, une entité décisionnelle globale (GDE) traite différents types de décisions myopes à l'aide des différentes techniques d'optimisation basée sur la simulation (SbO). De plus, les SbO peuvent adopter plusieurs rôles, permettant de réduire le comportement myope de plusieurs façons. Il est également possible d'avoir plusieurs niveaux d'autonomie en appliquant différents modes d'interaction. Ainsi, notre approche accepte des configurations dans lesquelles certains comportements myopes sont réduits et d'autres sont acceptés. Notre approche a été instanciée pour contrôler la cellule flexible AIP- PRIMECA de l'Université de Valenciennes. Les résultats des simulations ont montré que l'architecture proposée peut réduire les comportements myopes en établissant un équilibre entre la réactivité et la performance globale. Des expérimentations réelles ont été réalisées sur la cellule AIP-PRIMECA pour des scenarios dynamiques et des résultats prometteurs ont été obtenus

A real-time simulation-based optimisation environment for industrial scheduling

n order to cope with the challenges in industry today, such as changes in product diversity and production volume, manufacturing companies are forced to react more flexibly and swiftly. Furthermore, in order for them to survive in an ever-changing market, they also need to be highly competitive by achieving near optimal efficiency in their operations. Production scheduling is vital to the success of manufacturing systems in industry today, because the near optimal allocation of resources is essential in remaining highly competitive. The overall aim of this study is the advancement of research in manufacturing scheduling through the exploration of more effective approaches to address complex, real-world manufacturing flow shop problems. The methodology used in the thesis is in essence a combination of systems engineering, algorithmic design and empirical experiments using real-world scenarios and data. Particularly, it proposes a new, web services-based, industrial scheduling system framework, called OPTIMISE Scheduling System (OSS), for solving real-world complex scheduling problems. OSS, as implemented on top of a generic web services-based simulation-based optimisation (SBO) platform called OPTIMISE, can support near optimal and real-time production scheduling in a distributed and parallel computing environment. Discrete-event simulation (DES) is used to represent and flexibly cope with complex scheduling problems without making unrealistic assumptions which are the major limitations of existing scheduling methods proposed in the literature. At the same time, the research has gone beyond existing studies of simulation-based scheduling applications, because the OSS has been implemented in a real-world industrial environment at an automotive manufacturer, so that qualitative evaluations and quantitative comparisons of scheduling methods and algorithms can be made with the same framework. Furthermore, in order to be able to adapt to and handle many different types of real-world scheduling problems, a new hybrid meta-heuristic scheduling algorithm that combines priority dispatching rules and genetic encoding is proposed. This combination is demonstrated to be able to handle a wider range of problems or a current scheduling problem that may change over time, due to the flexibility requirements in the real-world. The novel hybrid genetic representation has been demonstrated effective through the evaluation in the real-world scheduling problem using real-world data

Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems

Three methods, based on Evolutionary Algorithms (EAs), to support and automate the design of dispatching rules for complex and dynamic scheduling problems are proposed in this thesis. The first method employs an EA to search for problem instances on which a given dispatching rule performs badly. These instances can then be analysed to reveal weaknesses of the tested rule, thereby providing guidelines for the design of a better rule. The other two methods are hyper-heuristics, which employ an EA directly to generate effective dispatching rules. In particular, one hyper-heuristic is based on a specific type of EA, called Genetic Programming (GP), and generates a single rule from basic job and machine attributes, while the other generates a set of work centre-specific rules by selecting a (potentially) different rule for each work centre from a number of existing rules. Each of the three methods is applied to some complex and dynamic scheduling problem(s), and the resulting dispatching rules are tested against benchmark rules from the literature. In each case, the benchmark rules are shown to be outperformed by a rule (set) that results from the application of the respective method, which demonstrates the effectiveness of the proposed methods

Simulation of production scheduling in manufacturing systems

Research into production scheduling environments has been primarily concerned with developing local priority rules for selecting jobs from a queue to be processed on a set of individual machines. Most of the research deals with the scheduling problems in terms of the evaluation of priority rules with respect to given criteria. These criteria have a direct effect on the production cost, such as mean make-span, flow-time, job lateness, m-process inventory and machine idle time. The project under study consists of the following two phases. The first is to deal with the development of computer models for the flow-shop problem, which obtain the optimum make-span and near-optimum solutions for the well-used criteria in the production scheduling priority rules. The second is to develop experimental analysis using a simulation technique, for the two main manufacturing systems, 1. Job-shop 2. Flexible Manufacturing System The two manufacturing types were investigated under the following conditions i. Dynamic problem conditions ii. Different operation time distributions iii. Different shop loads iv. Seven replications per experiment with different streams of random number v. The approximately steady state point for each replication was obtained. In the FMS, the material handling system used was the automated guided Vehicles (AGVs), buffer station and load/ unload area were also used. The aim of these analyses is to deal with the effectiveness of the priority rules on the selected criteria performance. The SIMAN software simulation was used for these studies