Scheduling uncertain orders in the customer–subcontractor context

Within the customer–subcontractor negotiation process, the first problem of the subcontractor is to provide the customer with a reliable order lead-time although his workload is partially uncertain. Actually, a part of the subcontractor workload is composed of orders under negotiation which can be either confirmed or cancelled. Fuzzy logic and possibility theory have widely been used in scheduling in order to represent the uncertainty or imprecision of processing times, but the existence of the manufacturing orders is not usually set into question. We suggest a method allowing to take into account the uncertainty of subcontracted orders. This method is consistent with list scheduling: as a consequence, it can be used in many classical schedulers. Its implementation in a scheduler prototype called TAPAS is described. In this article, we focus on the performance of validation tests which show the interest of the method

Optimizing The Global Performance Of Build-to-order Supply Chains

Build-to-order supply chains (BOSCs) have recently received increasing attention due to the shifting focus of manufacturing companies from mass production to mass customization. This shift has generated a growing need for efficient methods to design BOSCs. This research proposes an approach for BOSC design that simultaneously considers multiple performance measures at three stages of a BOSC Tier I suppliers, the focal manufacturing company and Tier I customers (product delivery couriers). We present a heuristic solution approach that constructs the best BOSC configuration through the selection of suppliers, manufacturing resources at the focal company and delivery couriers. The resulting configuration is the one that yields the best global performance relative to five deterministic performance measures simultaneously, some of which are nonlinear. We compare the heuristic results to those from an exact method, and the results show that the proposed approach yields BOSC configurations with near-optimal performance. The absolute deviation in mean performance across all experiments is consistently less than 4%, with a variance less than 0.5%. We propose a second heuristic approach for the stochastic BOSC environment. Compared to the deterministic BOSC performance, experimental results show that optimizing BOSC performance according to stochastic local performance measures can yield a significantly different supply chain configuration. Local optimization means optimizing according to one performance measure independently of the other four. Using Monte Carlo simulation, we test the impact of local performance variability on the global performance of the BOSC. Experimental results show that, as variability of the local performance increases, the mean global performance decreases, while variation in the global performance increases at steeper levels

A general framework integrating techniques for scheduling under uncertainty

Ces dernières années, de nombreux travaux de recherche ont porté sur la planification de tâches et l'ordonnancement sous incertitudes. Ce domaine de recherche comprend un large choix de modèles, techniques de résolution et systèmes, et il est difficile de les comparer car les terminologies existantes sont incomplètes. Nous avons cependant identifié des familles d'approches générales qui peuvent être utilisées pour structurer la littérature suivant trois axes perpendiculaires. Cette nouvelle structuration de l'état de l'art est basée sur la façon dont les décisions sont prises. De plus, nous proposons un modèle de génération et d'exécution pour ordonnancer sous incertitudes qui met en oeuvre ces trois familles d'approches. Ce modèle est un automate qui se développe lorsque l'ordonnancement courant n'est plus exécutable ou lorsque des conditions particulières sont vérifiées. Le troisième volet de cette thèse concerne l'étude expérimentale que nous avons menée. Au-dessus de ILOG Solver et Scheduler nous avons implémenté un prototype logiciel en C++, directement instancié de notre modèle de génération et d'exécution. Nous présentons de nouveaux problèmes d'ordonnancement probabilistes et une approche par satisfaction de contraintes combinée avec de la simulation pour les résoudre. ABSTRACT : For last years, a number of research investigations on task planning and scheduling under uncertainty have been conducted. This research domain comprises a large number of models, resolution techniques, and systems, and it is difficult to compare them since the existing terminologies are incomplete. However, we identified general families of approaches that can be used to structure the literature given three perpendicular axes. This new classification of the state of the art is based on the way decisions are taken. In addition, we propose a generation and execution model for scheduling under uncertainty that combines these three families of approaches. This model is an automaton that develops when the current schedule is no longer executable or when some particular conditions are met. The third part of this thesis concerns our experimental study. On top of ILOG Solver and Scheduler, we implemented a software prototype in C++ directly instantiated from our generation and execution model. We present new probabilistic scheduling problems and a constraintbased approach combined with simulation to solve some instances thereof