Reactive Scheduling of Job Processing against Machine Breakdowns for Non-disruptive Cell Manufacturing Systems

2013 ◽  
Vol 133 (4) ◽  
pp. 730-739
Author(s):  
Wan-Ling Li ◽  
Muhammad Hafidz Fazli bin Md Fauadi ◽  
Tomohiro Murata
2006 ◽  
Vol 44 (18-19) ◽  
pp. 3727-3742 ◽  
Author(s):  
Y. Tanimizu ◽  
T. Sakaguchi ◽  
K. Iwamura ◽  
N. Sugimura

2002 ◽  
Vol 10 (2) ◽  
pp. 119-128 ◽  
Author(s):  
J. S. Culik ◽  
I. S. Goncharovsky ◽  
J. A. Rand ◽  
A. M. Barnett

2019 ◽  
Vol 39 (5) ◽  
pp. 944-962 ◽  
Author(s):  
Sahar Tadayonirad ◽  
Hany Seidgar ◽  
Hamed Fazlollahtabar ◽  
Rasoul Shafaei

Purpose In real manufacturing systems, schedules are often disrupted with uncertainty factors such as random machine breakdown, random process time, random job arrivals or job cancellations. This paper aims to investigate robust scheduling for a two-stage assembly flow shop scheduling with random machine breakdowns and considers two objectives makespan and robustness simultaneously. Design/methodology/approach Owing to its structural and algorithmic complexity, the authors proposed imperialist competitive algorithm (ICA), genetic algorithm (GA) and hybridized with simulation techniques for handling these complexities. For better efficiency of the proposed algorithms, the authors used artificial neural network (ANN) to predict the parameters of the proposed algorithms in uncertain condition. Also Taguchi method is applied for analyzing the effect of the parameters of the problem on each other and quality of solutions. Findings Finally, experimental study and analysis of variance (ANOVA) is done to investigate the effect of different proposed measures on the performance of the obtained results. ANOVA's results indicate the job and weight of makespan factors have a significant impact on the robustness of the proposed meta-heuristics algorithms. Also, it is obvious that the most effective parameter on the robustness for GA and ICA is job. Originality/value Robustness is calculated by the expected value of the relative difference between the deterministic and actual makespan.


Author(s):  
Michael Mitnovitsky ◽  
Miri Weiss Cohen ◽  
Moshe Shpitalni

This paper examines a flexible job shop problem that considers dynamic events, such as stochastic job arrivals, uncertain processing times, unexpected machine breakdowns and the possibility of processing flexibility. To achieve this goal, a new agent-based adaptive control system has been developed at the factory level, along with advanced decision-making strategies that provide responsive factories with adaptation and reconfiguration capabilities and advanced complementary scheduling abilities. The aim is to facilitate operational flexibility and increase productivity as well as offer strategic advantages such as analysis of factory development options by simulation. The feasibility of the proposed system is demonstrated by simulation under various experimental settings, among them shop utilization level, due date tightness and breakdown level.


Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1389
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Rodrigo Olivares ◽  
César Carrasco ◽  
Eduardo Rodriguez-Tello ◽  
...  

In this paper, we integrate the autonomous search paradigm on a swarm intelligence algorithm in order to incorporate the auto-adjust capability on parameter values during the run. We propose an independent procedure that begins to work when it detects a stagnation in a local optimum, and it can be applied to any population-based algorithms. For that, we employ the autonomous search technique which allows solvers to automatically re-configure its solving parameters for enhancing the process when poor performances are detected. This feature is dramatically crucial when swarm intelligence methods are developed and tested. Finding the best parameter values that generate the best results is known as an optimization problem itself. For that, we evaluate the behavior of the population size to autonomously be adapted and controlled during the solving time according to the requirements of the problem. The proposal is testing on the dolphin echolocation algorithm which is a recent swarm intelligence algorithm based on the dolphin feature to navigate underwater and identify prey. As an optimization problem to solve, we test a machine-part cell formation problem which is a widely used technique for improving production flexibility, efficiency, and cost reduction in the manufacturing industry decomposing a manufacturing plant in a set of clusters called cells. The goal is to design a cell layout in such a way that the need for moving parts from one cell to another is minimized. Using statistical non-parametric tests, we demonstrate that the proposed approach efficiently solves 160 well-known cell manufacturing instances outperforming the classic optimization algorithm as well as other approaches reported in the literature, while keeping excellent robustness levels.


2001 ◽  
Vol III.01.1 (0) ◽  
pp. 335-336
Author(s):  
Yoshitaka TANIMIZU ◽  
Akihito TEI ◽  
Tatsuhiko SAKAGUCHI ◽  
Nobuhiro SUGIMURA

1997 ◽  
Vol 30 (14) ◽  
pp. 165-170
Author(s):  
Kwang Bang Woo ◽  
Sung Soo Kim ◽  
Kyeon Hur

Author(s):  
Tatsuhiko SAKAGUCHI ◽  
Yoshitaka TANIMIZU ◽  
Tsuyoshi MIYAMAE ◽  
Yasuhiro MAEDA ◽  
Keiichi SHIRASE ◽  
...  

2008 ◽  
Vol 19 (2) ◽  
pp. 235-252 ◽  
Author(s):  
Mounir Elleuch ◽  
Habib Ben Bacha ◽  
Faouzi Masmoudi ◽  
Aref Y. Maalej

Sign in / Sign up

Export Citation Format

Share Document