A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process

2014 ◽  
Vol 236 (1) ◽  
pp. 51-60 ◽  
Author(s):  
Kun Mao ◽  
Quan-ke Pan ◽  
Xinfu Pang ◽  
Tianyou Chai
Keyword(s):  
Continuous Casting ◽  
Lagrangian Relaxation ◽  
Casting Process ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Continuous Casting Process ◽  
Hybrid Flowshop ◽  
Hybrid Flowshop Scheduling ◽  
Flowshop Scheduling Problem

scholarly journals A Discrete Group Search Optimizer for Hybrid Flowshop Scheduling Problem with Random Breakdown

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Zhe Cui ◽  
Xingsheng Gu
Keyword(s):  
Discrete Group ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Flowshop Scheduling ◽  
Hybrid Flowshop ◽  
Random Breakdown ◽  
Hybrid Flowshop Scheduling ◽  
Discrete Operators ◽  
Flowshop Scheduling Problem ◽  
Group Search

The scheduling problems have been discussed in the literature extensively under the assumption that the machines are permanently available without any breakdown. However, in the real manufacturing environments, the machines could be unavailable inevitably for many reasons. In this paper, the authors introduce the hybrid flowshop scheduling problem with random breakdown (RBHFS) together with a discrete group search optimizer algorithm (DGSO). In particular, two different working cases, preempt-resume case, and preempt-repeat case are considered under random breakdown. The proposed DGSO algorithm adopts the vector representation and several discrete operators, such as insert, swap, differential evolution, destruction, and construction in the producers, scroungers, and rangers phases. In addition, an orthogonal test is applied to configure the adjustable parameters in the DGSO algorithm. The computational results in both cases indicate that the proposed algorithm significantly improves the performances compared with other high performing algorithms in the literature.

Sign in / Sign up

Export Citation Format

Share Document