Project scheduling under undertainty – survey and research potentials.

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.Management; Project management; Robustness; Scheduling; Stability;

A tabu search procedure for developing robust predicitive project schedules.

Proactive scheduling aims at the generation of robust baseline schedules that are as much as possible protected against disruptions that may occur during project execution. In this paper, we focus on disruptions caused by stochastic resource availabilities and aim at generating stable baseline schedules. A schedule’s robustness (stability) is measured by the weighted deviation between the planned and the actually realized activity starting times during project execution. We present a tabu search procedure that operates on a surrogate, free slack based objective function. Its effectiveness is demonstrated by extensive computational results obtained on a set of randomly generated test instances.Project scheduling; Robustness; Proactive; Stability;

A control strategy for promoting shop-floor stability

This research aimed to study real-time shop floor control problem in a manufacturing environment with dual resource (machine and labour), under impact of machine breakdowns. In this study, a multiperspective (order and resource perspectives) control strategy is proposed to improve effectiveness of dispatching procedure for promoting shop floor stability. In this control strategy, both order and resource related factors have been taken into account according to information on direct upstream and succeeding workcentres. A simulated manufacturing environment has been developed as a platform for testing and analysing performances of the proposed control strategy. A series of experiments have been carried out in a variety of system settings and conditions in the simulated manufacturing environment. The experiments have shown that the proposed control strategy outperformed the ODD (Earliest Operation Due Date) rule in hostile environments, which have been described by high level of shop load and/or high intensity of machine breakdowns. In hostile environments, the proposed control strategy has given best performance when overtime was not used, and given promising results in reduction of overtime cost when overtime was used to compensate for capacity loss. Further direction of research is also suggested

On the construction of stable project baseline schedules.

The vast majority of project scheduling efforts assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. In reality, however, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. It is of interest to develop pre-schedules that can absorb disruptions in activity durations without affecting the planning of other activities, such that co-ordination of resources and material procurement for each of the activities can be performed as smoothly as possible. The objective of this paper is to develop and evaluate various approaches for constructing a stable pre-schedule, which is unlikely to undergo major changes when it needs to be repaired as a reaction to minor activity duration disruptions.

A study of maintenance contribution to joint production and preventive maintenance scheduling problems in the robustness framework.

International audienceIn this paper, we deal with a joint production and Preventive Maintenance (PM) scheduling problem in the robustness framework. The contributions of this paper are twofold. First, we will establish that the insertion of maintenance activities during production scheduling can hedge against some changes in the shop environment. Furthermore, we will check if respecting the optimal intervals of maintenance activities guarantees a minimal robustness threshold. Then, we will try to identify from the used optimisation criteria those that allow making predictive schedules more robust. The computational experiments in a flowshop show that joint production and PM schedules are more robust than production schedules and maintenance provides an acceptable tradeoff between equipment reliability and performance loss under disruption

Joint scheduling of jobs and preventive maintenance operations in the flowshop sequencing problem: A resolution with sequential and integrated strategies.

International audienceUsually, scheduling of maintenance operations and production sequencing are dealt with separately in the literature and, therefore, also in the industry. Given that maintenance affects available production time and elapsed production time affects the probability of machine failure, this interdependency seems to be overlooked in the literature. This paper presents a comparative study on joint production and preventive maintenance scheduling strategies regarding flowshop problems. The sequential strategy which consists of two steps: first scheduling the production jobs then inserting maintenance operations, taking the production schedule as a strong constraint. The integrated one which consists of simultaneously scheduling both maintenance and production activities based on a common representation of these two activities. For each strategy, a constructive heuristic and two meta-heuristics are proposed: NEH heuristic, Genetic algorithm and Taboo search. The goal is to optimize an objective function which takes into account both production and maintenance criteria. The proposed heuristics have been applied to non-standard test problems which represent joint production and maintenance benchmark flowshop scheduling problems taken from Benbouzid et al. (2003). A comparison of the solutions yielded by the heuristics developed in this paper with the heuristic solutions given by Taillard (1993) is undertaken with respect to the minimization of performance loss after maintenance insertion. The comparison shows that the proposed integrated GAs are clearly superior to all the analyzed algorithms

Intelligent production control for time-constrained complex job shops

Im Zuge der zunehmenden Komplexität der Produktion wird der Wunsch nach einer intelligenten Steuerung der Abläufe in der Fertigung immer größer. Sogenannte Complex Job Shops bezeichnen dabei die komplexesten Produktionsumgebungen, die deshalb ein hohes Maß an Agilität in der Steuerung erfordern. Unter diesen Umgebungen sticht die besonders Halbleiterfertigung hervor, da sie alle Komplexitäten eines Complex Job-Shop vereint. Deshalb ist die operative Exzellenz der Schlüssel zum Erfolg in der Halbleiterindustrie. Diese Exzellenz hängt ganz entscheidend von einer intelligenten Produktionssteuerung ab. Ein Hauptproblem bei der Steuerung solcher Complex Job-Shops, in diesem Fall der Halbleiterfertigung, ist das Vorhandensein von Zeitbeschränkungen (sog. time-constraints), die die Transitionszeit von Produkten zwischen zwei, meist aufeinanderfolgenden, Prozessen begrenzen. Die Einhaltung dieser produktspezifischen Zeitvorgaben ist von größter Bedeutung, da Verstöße zum Verlust des betreffenden Produkts führen. Der Stand der Technik bei der Produktionssteuerung dieser Dispositionsentscheidungen, die auf die Einhaltung der Zeitvorgaben abzielen, basiert auf einer fehleranfälligen und für die Mitarbeiter belastenden manuellen Steuerung. In dieser Arbeit wird daher ein neuartiger, echtzeitdatenbasierter Ansatz zur intelligenten Steuerung der Produktionssteuerung für time-constrained Complex Job Shops vorgestellt. Unter Verwendung einer jederzeit aktuellen Replikation des realen Systems werden sowohl je ein uni-, multivariates Zeitreihenmodell als auch ein digitaler Zwilling genutzt, um Vorhersagen über die Verletzung dieser time-constraints zu erhalten. In einem zweiten Schritt wird auf der Grundlage der Erwartung von Zeitüberschreitungen die Produktionssteuerung abgeleitet und mit Echtzeitdaten anhand eines realen Halbleiterwerks implementiert. Der daraus resultierende Ansatz wird gemeinsam mit dem Stand der Technik validiert und zeigt signifikante Verbesserungen, da viele Verletzungen von time-constraints verhindert werden können. Zukünftig soll die intelligente Produktionssteuerung daher in weiteren Complex Job Shop-Umgebungen evaluiert und ausgerollt werden

Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach

Flexible flow shop scheduling problems are NP-hard and tend to become more complex when stochastic uncertainties are taken into consideration. Although some methods have been developed to address such problems, they remain inherently difficult to solve by any single approach. This paper presents a novel decomposition-based approach (DBA), which combines both the shortest processing time (SPT) and the genetic algorithm (GA), to minimizing the makespan of a flexible flow shop (FFS) with stochastic processing times. In the proposed DBA, a neighbouring K-means clustering algorithm is developed to firstly group the machines of an FFS into an appropriate number of machine clusters, based on their stochastic nature. Two optimal back propagation networks (BPN), corresponding to the scenarios of simultaneous and non-simultaneous job arrivals, are then selectively adopted to assign either SPT or GA to each machine cluster for sub-schedule generation. Finally, an overall schedule is generated by integrating the sub-schedules of machine clusters. Computation results show that the DBA outperforms SPT and GA alone for FFS scheduling with stochastic processing times. © 2012 Elsevier Ltd. All rights reserved.postprin

A decomposition based algorithm for flexible flow shop scheduling with machine breakdown

Research on flow shop scheduling generally ignores uncertainties in real-world production because of the inherent difficulties of the problem. Scheduling problems with stochastic machine breakdown are difficult to solve optimally by a single approach. This paper considers makespan optimization of a flexible flow shop (FFS) scheduling problem with machine breakdown. It proposes a novel decomposition based approach (DBA) to decompose a problem into several sub-problems which can be solved more easily, while the neighbouring K-means clustering algorithm is employed to group the machines of an FFS into a few clusters. A back propagation network (BPN) is then adopted to assign either the shortest processing time (SPT) or the genetic algorithm (GA) to each cluster to solve the sub-problems. If two neighbouring clusters are allocated with the same approach, they are subsequently merged. After machine grouping and approach assignment, an overall schedule is generated by integrating the solutions to the sub-problems. Computation results reveal that the proposed approach is superior to SPT and GA alone for FFS scheduling with machine breakdown. © 2009 IEEE.published_or_final_versionThe IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA 2009), Hong Kong, 11-13 May 2009. In Proceedings of CIMSA, 2009, p. 134-13

Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research

Scheduling is a decision-making process that is concerned with the allocation of limited resources to competing tasks (operations of jobs) over a time period with the goal of optimising one or more objectives. In theory, the objective is usually to optimise some classical system performance measures such as makespan, tardiness/earliness and flowtime under deterministic and static assumptions. In practice, however, scheduling systems operate in dynamic and stochastic environments. Hence, there is a need to incorporate both uncertainty and dynamic elements into the scheduling process. In this paper, the major issues involved in scheduling decisions are discussed and the basic approaches to tackle these problems in manufacturing environments are analysed. Proactive scheduling is then focused on and several robustness and stability measures are presented. Previous research on scheduling robustness and stability is also reviewed and further research directions are suggested