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.

USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS

2009 ◽  
Vol 17 (04) ◽  
pp. 559-584 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Completion Time ◽  
Ant Colony Algorithm ◽  
Fuzzy Numbers ◽  
Flow Shop ◽  
Computational Procedure ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times

The flow shop scheduling problems with fuzzy processing times are investigated in this paper. For some special kinds of fuzzy numbers, the analytic formulas of the fuzzy compltion time can be obtained. For the general bell-shaped fuzzy numbers, we present a computational procedure to obtain the approximated membership function of the fuzzy completion time. We define a defuzzification function to rank the fuzzy numbers. Under this ranking concept among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Because the ant colony algorithm has been successfully used to solve the scheduling problems with real-valued processing times, we shall also apply the ant colony algorithm to search for the best schedules when the processing times are assumed as fuzzy numbers. Numerical examples are also provided and solved by using the commercial software MATLAB.

scholarly journals A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability

2017 ◽  
Vol 10 (12) ◽  
pp. 197
Author(s):  
Mohammad Rahmanidoust
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Evolutionary Strategy ◽  
Optimization Approach ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Multi Objective ◽  
No Wait ◽  
Two Stages ◽  
Flexible Flow Shop Scheduling

The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.

scholarly journals Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Rong-Hwa Huang ◽  
Shun-Chi Yu
Keyword(s):  
Ant Colony Optimization ◽  
Flow Shop ◽  
Pso Algorithm ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Two Stage ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Flexible Flow Shop Scheduling

The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both small and large problems, EACO is more effective and robust than both the particle swarm optimization (PSO) algorithm and the ACO algorithm. Importantly, this work demonstrates that EACO can solve complex scheduling problems in an acceptable period of time.

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
Sign in / Sign up

Export Citation Format

Share Document