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

  title={Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research},
  author={Ihsan Sabuncuoglu and S. Goren},
  journal={International Journal of Computer Integrated Manufacturing},
  pages={138 - 157}
  • I. Sabuncuoglu, S. Goren
  • Published 28 January 2009
  • Business
  • International Journal of Computer Integrated Manufacturing
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… 
Optimization of schedule robustness and stability under random machine breakdowns and processing time variability
The computational results show that the beam search heuristic is capable of generating robust schedules with little average deviation from the optimal objective function value and it performs significantly better than a number of heuristics available in the literature for all five measures.
Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
This work proposes a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns; a surrogate stability measure is developed and a branch-and-bound algorithm is developed for this problem variant.
Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques
This research presents the case of a Printed Wiring Board Manufacturer’s drilling operation, which is a group of unrelated parallel machines, and investigates job and machine hedges as well as periodic and event driven rescheduling policies.
Tardiness minimisation heuristic for job shop scheduling under uncertainties using group sequences
A new decision-aid criterion for selecting the schedule that fits best the real state of the shop is proposed using a greedy heuristic that anticipates the maximum tardiness in a job shop scheduling environment and simulation tests show the usefulness of this criterion compared to another frequently used criterion.
Minimizing tardiness for job shop scheduling under uncertainties
This paper proposes and evaluates a new criterion called the best-case in order to be used in real-time during the online phase of the groups of permutable operations, offering an optimal or near-optimal solution from a set of solutions.
Procurement scheduling under supply and demand uncertainty: Case study for comparing classical, reactive, and proactive scheduling
  • Joohyun Shin, Jay H. Lee
  • Business
    2015 15th International Conference on Control, Automation and Systems (ICCAS)
  • 2015
Supply chain of a manufacturing system contains procurement activity, and unloading raw materials from delivery vessels to storage tanks should be scheduled optimally, subject to the operational
A proactive scheduling approach to steel rolling process with stochastic machine breakdown
A surrogate-assisted multi-objective evolutionary algorithm based on Elitist non-dominated sorting genetic algorithm is proposed to solve the proactive scheduling problem under consideration and Computational experiments of numerical and practical data indicate that the proposed proactive scheduling approach performs well in response to stochastic machine breakdown.


Robust scheduling to hedge against processing time uncertainty in single-stage production
This paper formalizes the robust scheduling concept for scheduling situations with uncertain or variable processing times, and considers a single-machine environment where the performance criterion of interest is the total flow time over all jobs.
β-Robust scheduling for single-machine systems with uncertain processing times
In scheduling environments with processing time uncertainty, system performance is determined by both the sequence in which jobs are ordered and the actual processing times of jobs. For these
Predictable scheduling of a single machine subject to breakdowns
  • S. Mehta
  • Business
    Int. J. Comput. Integr. Manuf.
  • 1999
A predictable scheduling approach is presented, where the predictive schedule is built with such objectives and the effects of disruptions on planned activities are measured by the difference between planned and realized job completion times.
Predictable scheduling of a single machine with breakdowns and sensitive jobs
Production schedules released to the shop floor have two important functions: allocating shop resources to different jobs to optimize some measure of shop performance and serving as a basis for
Reactive scheduling in a dynamic and stochastic FMS environment
A simulation-based scheduling system for flexible manufacturing systems is developed and several reactive scheduling policies are proposed and tested under various experimental conditions, processing time variations, and machine breakdowns.
Generating robust and flexible job shop schedules using genetic algorithms
  • M. Jensen
  • Business
    IEEE Trans. Evol. Comput.
  • 2003
Through experiments, it is shown that using a genetic algorithm it is possible to find robust and flexible schedules with a low makespan and these schedules are demonstrated to perform significantly better in rescheduling after a breakdown than ordinary schedules.