• Home
  • Search
  • On the Robust and Stable Flowshop Scheduling Under Stochastic and Dynamic Disruptions
  • Cite Icon76
  • https://doi.org/10.1109/tem.2017.2712611Copy DOI Icon

On the Robust and Stable Flowshop Scheduling Under Stochastic and Dynamic Disruptions

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we consider a permutation flowshop scheduling problem with the total flow time as the schedule performance measure. A proactive-reactive approach is designed to simultaneously deal with stochastic disruptions (e.g., machine breakdowns) and dynamic events (e.g., newly arriving jobs and delay in job availability). In the proactive stage, the stochastic machine breakdown is hedged against the construction of a robust and stable baseline schedule. This schedule is either optimized by incorporating uncertainty into two surrogate measures or obtained by simulation. Robustness is measured by the expected schedule performance, while stability is measured by the aggregation of dissatisfactions of manager, shopfloor operator, and customers using the prospect theory. In the reactive stage, we assume that the stochastic and dynamic disruptions concurrently occur. Unlike the simple right-shifting method, a more effective rescheduling approach is proposed to balance the realized schedule performance with stability. A common issue in these two stages is the conflict between objectives. Thus, we propose a hybridization strategy that successfully enhances the classic Non-dominated Sorting Genetic Algorithm (NSGA-II and the hybridized algorithm outperforms NSGA-II, multiobjective evolutionary algorithm based on decomposition, and multiobjective memetic algorithms designed for deterministic scheduling problems. Finally, extensive computational studies on the Taillard flowshop benchmark instances are conducted to illustrate the effectiveness of the proposed proactive-reactive approach and the algorithm hybridization strategy.

Similar Papers
  • Research Article
  • Citations30

Stochastic machine breakdown and discrete delivery in an imperfect inventory-production system

  • Dec 01, 2016
  • Journal of Industrial & Management Optimization
  • Ata Allah Taleizadeh +3
  • Conference Article
  • Citations157

Approximating total flow time on parallel machines

  • Jan 01, 1997
  • Stefano Leonardi +1
  • Research Article
  • Citations45

Genetic programming hyper-heuristic-based solution for dynamic energy-efficient scheduling of hybrid flow shop scheduling with machine breakdowns and random job arrivals

  • May 31, 2024
  • Expert Systems With Applications
  • Jianguo Duan +4
  • Research Article
  • Citations20

Minimal repair policies for an economic manufacturing process

  • Dec 01, 1998
  • Journal of Quality in Maintenance Engineering
  • T Dohi +2
  • Book Chapter
  • Citations15

Investigating the Generality of Genetic Programming Based Hyper-heuristic Approach to Dynamic Job Shop Scheduling with Machine Breakdown

  • Dec 27, 2016
  • John Park +4
  • Research Article
  • Citations553

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

  • Mar 01, 2007
  • European Journal of Operational Research
  • M Fatih Tasgetiren +3
  • Research Article
  • Citations42

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

  • Dec 04, 2011
  • The International Journal of Advanced Manufacturing Technology
  • Manas Ranjan Singh +1
  • Research Article
  • Citations48

Hybrid method integrating agent-based modeling and heuristic tree search for scheduling of complex batch processes

  • Sep 18, 2013
  • Computers & Chemical Engineering
  • Yunfei Chu +2
  • Research Article
  • Citations17

Behaviour perception-based disruption models for the parallel machine capacitated lot-sizing and scheduling problem

  • Sep 18, 2016
  • International Journal of Production Research
  • Huasheng Yang +4
  • Research Article

Parallel Machine Scheduling with WMSD Risk Considerations

  • Oct 31, 2019
  • European Journal of Science and Technology
  • Ercan Şenyiğit +1
  • Research Article
  • Citations7

Scheduling data transfers in a network and the set scheduling problem

  • May 22, 2003
  • Journal of Algorithms
  • Ashish Goel +3
  • Research Article
  • Citations26

NSGA-II applied to dynamic flexible job shop scheduling problems with machine breakdown

  • Dec 30, 2018
  • Modern Physics Letters B
  • Chao Chen +2
  • PDF
  • Research Article
  • Citations2

Scheduling with gaps: new models and algorithms

  • Jul 21, 2021
  • Journal of Scheduling
  • Marek Chrobak +3
  • Research Article
  • Citations3

A Pareto-Optimal Solution for a Multi-Objective Scheduling Problem with Periodic Maintenance Requirement

  • Apr 01, 2012
  • International Journal of Operations Research and Information Systems
  • Deniz Mungan +3
  • Conference Article
  • Citations5

Critical path scheduling of task systems with resource and processor constraints (Extended Abstract)

  • Jan 01, 1980
  • Errol L Lloyd
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.