Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study

2004 ◽  
Vol 42 (19) ◽  
pp. 4015-4030 ◽  
Author(s):  
T. Yang * ◽  
Y. Kuo ◽  
I. Chang
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Simulation Optimization ◽  
Flow Shop Scheduling ◽  
Optimization Approach ◽  
Shop Scheduling ◽  
Multiple Processors

A simulation optimization approach for flow-shop scheduling problem: a canned fruit industry

2014 ◽  
Vol 77 (1-4) ◽  
pp. 751-761 ◽  
Author(s):  
A. Azadeh ◽  
B. Maleki-Shoja ◽  
M. Sheikhalishahi ◽  
A. Esmaili ◽  
A. Ziaeifar ◽  
...  
Keyword(s):  
Flow Shop ◽  
Simulation Optimization ◽  
Flow Shop Scheduling ◽  
Optimization Approach ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Canned Fruit

An efficiency improvement of flexible flow shop scheduling in automotive part company

2020 ◽  
pp. 1-14
Author(s):  
Waraporn Fangrit ◽  
Hwa Jen Yap ◽  
Mukhtar Fatihu Hamza ◽  
Siow-Wee Chang ◽  
Keem Siah Yap ◽  
...  
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Simulation Software ◽  
Flow Shop Scheduling ◽  
Current Status ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Scheduling Method ◽  
Automotive Part ◽  
Flexible Flow Shop Scheduling

Flexible flow shop is becoming more interested and applied in industries due to its impact from higher workloads. Flexible flow shop scheduling problem is focused to minimize the makespan. A metaheuristic model based on Hybrid Tabu Search is developed to overcome this problem. Firstly, Hybrid Tabu Search is modelled based on the factory data. The Earliest Due Date rule is used as the scheduling method for the current status. FlexSim simulation software is used to evaluate the Hybrid Tabu Search model. The outcome is validated with two different basic heuristic solutions; Campbell, Dudek and Smith’s and Gupta’s heuristics. It is found that the proposed model can improve the job sequence based on makespan criteria.

scholarly journals Integrated Optimization Approach of Hybrid Flow-Shop Scheduling Based on Process Set

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 223782-223796
Author(s):  
Xixing Li ◽  
Hongtao Tang ◽  
Zhipeng Yang ◽  
Rui Wu ◽  
Yabo Luo
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Optimization Approach ◽  
Shop Scheduling ◽  
Integrated Optimization ◽  
Hybrid Flow Shop Scheduling

An Optimization Approach for Surgery Scheduling under Multi-Resource Constraints

2012 ◽  
Vol 201-202 ◽  
pp. 943-946
Author(s):  
Jiao Yin ◽  
Wei Xiang ◽  
Sai Feng Chen
Keyword(s):  
Resource Selection ◽  
Ant Colony Algorithm ◽  
Resource Constraints ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Optimization Approach ◽  
Surgery Scheduling ◽  
Shop Scheduling ◽  
Flexible Flow Shop Scheduling

Surgery scheduling under upstream and downstream resource constraints was described as a three-stage multi-resource constrained flexible flow-shop scheduling problem in this study and an optimization approach based on ant colony algorithm was proposed for obtaining an optimal surgery schedule with respect to minimizing the makespan. A resource selection rule and strategy of overtime judging and adjusting was designed to allocate the resources reasonably and to make the scheduling results closer to reality. Compared to actual scheduling, the computerized result shows that the improved ant colony algorithm proposed in this paper achieved good results in shortening total time and allocating resources for surgery scheduling.

Sign in / Sign up

Export Citation Format

Share Document