Using real-time information to reschedule jobs in a flowshop with variable processing times

Versión revisada. Embargo 36 mesesIn a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, a question arises regarding when and how this data can be used to improve scheduling decisions. While it is acknowledged that a continuous rescheduling based on the updated information may be beneficial as it serves to adapt the schedule to unplanned events, this rather general intuition has not been supported by a thorough experimentation, particularly for multi-stage manufacturing systems where such continuous rescheduling may introduce a high degree of nervousness in the system and deteriorates its performance. In order to study this research problem, in this paper we investigate how real-time information on the completion times of the jobs in a flowshop with variable processing times can be used to reschedule the jobs. In an exhaustive computational experience, we show that rescheduling policies pay off as long as the variability of the processing times is not very high, and only if the initially generated schedule is of good quality. Furthermore, we propose several rescheduling policies to improve the performance of continuous rescheduling while greatly reducing the frequency of rescheduling. One of these policies, based on the concept of critical path of a flowshop, outperforms the rest of policies for a wide range of scenarios.Ministerio de Ciencia e Innovación DPI2016-80750-

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;

Solution and quality robust project scheduling: a methodological framework.

The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic environment. During execution, however, projects may be the subject of considerable uncertainty, which may lead to numerous schedule disruptions. Predictive-reactive scheduling refers to the process where a baseline schedule is developed prior to the start of the project and updated if necessary during project execution. It is the objective of this paper to review possible procedures for the generation of proactive (robust) schedules, which are as well as possible protected against schedule disruptions, and for the deployment of reactive scheduling procedures that may be used to revise or re-optimize the baseline schedule when unexpected events occur. We also offer a methodological framework that should allow project management to identify the proper scheduling methodology for different project scheduling environments. Finally, we survey the basics of Critical Chain scheduling and indicate in which environments it is useful.Framework; Information; Management; Processes; Project management; Project scheduling; Project scheduling under uncertainty; Stability; Robust scheduling; Quality; Scheduling; Stability; Uncertainty;

A novel class of scheduling policies for the stochastic resource-constrained project scheduling problem.

We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically during project execution. The pre-processing decisions entail the addition of precedence constraints to the scheduling instance, hereby resolving some potential resource conflicts. We compare the performance of this new class with existing scheduling policies for the stochastic resource-constrained project scheduling problem, and we observe that the new class is significantly better when the variability in the activity durations is medium to high.Project scheduling; Uncertainty; Stochastic activity durations; Scheduling policies;

A simheuristic algorithm for solving an integrated resource allocation and scheduling problem

Modern companies have to face challenging configuration issues in their manufacturing chains. One of these challenges is related to the integrated allocation and scheduling of resources such as machines, workers, energy, etc. These integrated optimization problems are difficult to solve, but they can be even more challenging when real-life uncertainty is considered. In this paper, we study an integrated allocation and scheduling optimization problem with stochastic processing times. A simheuristic algorithm is proposed in order to effectively solve this integrated and stochastic problem. Our approach relies on the hybridization of simulation with a metaheuristic to deal with the stochastic version of the allocation-scheduling problem. A series of numerical experiments contribute to illustrate the efficiency of our methodology as well as their potential applications in real-life enterprise settings

Meta-heuristic & hyper-heuristic scheduling tools for biopharmaceutical production

The manufacturing of biopharmaceuticals requires substantial investments and necessitates long-term planning. Complicating the task of determining optimal production plans are large portfolios of products and facilities which limit the tractability of exact solution methods, and uncertainties & stochastic events which often render plans obsolete when reality deviates from the expectation. This thesis therefore describes decisional tools that are able to cope with these complexities. First, a capacity planning problem for a network of facilities and multiple products was tackled. Inspired by meta-heuristic approaches to job shop scheduling, a tailored construction heuristic that builds a production plan based on a sequence — optimised by a genetic algorithm—of product demands was proposed. Comparisons to a mathematical programming model demonstrated its competitiveness on certain scenarios and its applicability to a multi-objective problem. Next, a custom object-oriented model was introduced for a manufacturing scheduling system that utilised a failure-prone perfusion-based bioprocess. With this, process design decisions such as cell culture run time and process configuration, and single-product facility scheduling strategies were evaluated whilst incorporating simulations of stochastic failure events and uncertain demand. This model was then incorporated into a larger hyper-heuristic to determine optimal scheduling policies for a multi-product problem. Various policy representations are tested and a few policies are adapted from the literature to fit this specific problem. In addition, a novel policy utilising a look-ahead heuristic is proposed. The benefit of parameter tuning using evolutionary algorithms is demonstrated and shows that tuned policies perform much better than a policy that estimates parameters based on service level considerations. In addition, the disadvantages of relying on a fixed or rigid production sequence policy in the face of uncertainty is highlighted

Production planning and control of closed-loop supply chains

More and more supply chains emerge that include a return flow of materials. Many original equipment manufacturers are nowadays engaged in the remanufacturing business. In many process industries, production defectives and by-products are reworked. These closed-loop supply chains deserve special attention. Production planning and control in such hybrid systems is a real challenge, especially due to increased uncertainties. Even companies that are engaged in remanufacturing operations only, face more complicated planning situations than traditional manufacturing companies.We point out the main complicating characteristics in closed-loop systems with both remanufacturing and rework, and indicated the need for new or modified/extended production planning and control approaches. An overview of the existing scientific contributions is given. It appears that we only stand at the beginning of this line of research, and that many more contributions are needed and expected in the future.closed-loop supply chains;Production planning and control

Resource-constrained project scheduling for timely project completion with stochastic activity durations.

We investigate resource-constrained project scheduling with stochastic activity durations. Various objective functions related to timely project completion are examined, as well as the correlation between these objectives. We develop a GRASP-heuristic to produce high-quality solutions, using so-called descriptive sampling. The algorithm outperforms other existing algorithms for expected-makespan minimization. The distribution of the possible makespan realizations for a given scheduling policy is studied, and problem difficulty is explored as a function of problem parameters.GRASP; Project scheduling; Uncertainty;