Flexible flow shop equipment utilization rate with time window constraints scheduling optimization problems

2016 ◽  
Author(s):  
Zhonghua Han ◽  
Yue Sun ◽  
Ce Xu ◽  
Xiaoting Dong ◽  
Zhe Lv
Keyword(s):  
Flow Shop ◽  
Optimization Problems ◽  
Time Window ◽  
Utilization Rate ◽  
Scheduling Optimization ◽  
Flexible Flow Shop ◽  
Equipment Utilization ◽  
Time Window Constraints

scholarly journals A Comprehensive Study of Vehicle Routing Problem With Time Windows Using Ant Colony Optimization Techniques

2018 ◽  
Vol 7 (2.32) ◽  
pp. 80 ◽  
Author(s):  
Avirup Guha Neogi ◽  
Singamreddy Mounika ◽  
Salagrama Kalyani ◽  
S A. Yogananda Sai
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Time Window ◽  
Time Windows ◽  
Optimization Techniques ◽  
Ant Colony ◽  
Routing Problem ◽  
Time Window Constraints

Ant Colony Optimization (ACO) is a nature-inspired swarm intelligence technique and a metaheuristic approach which is inspired by the foraging behavior of the real ants, where ants release pheromones to find the best and shortest route from their nest to the food source. ACO is being applied to various optimization problems till date and has been giving good quality results in the field. One such popular problem is known as Vehicle Routing Problem(VRP). Among many variants of VRP, this paper presents a comprehensive survey on VRP with Time Window constraints(VRPTW). The survey is presented in a chronological order discussing which of the variants of ACO is used in each paper followed by the advantages and limitations of the same.  

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 Randomized and Generated Instances Fitting with the Home Health Care Problem Subjected to Certain Constraints

2021 ◽  
Vol 11 (8) ◽  
pp. 3346
Author(s):  
Colin Huvent ◽  
Caroline Gagné ◽  
Aymen Sioud
Keyword(s):  
Health Care ◽  
Home Health Care ◽  
Hospital Cost ◽  
Time Window ◽  
Developed Countries ◽  
Home Health ◽  
Precedence Constraints ◽  
Social Organizations ◽  
Health Support ◽  
Time Window Constraints

Home Health Care (HHC) is a worldwide issue. It focuses on how medical and social organizations of different countries handle providing patients with health support at home. In most developed countries, reducing hospital cost constitutes a main objective. It is important to research the improvement of HHC logistics. This paper addressed the generation and development of a benchmark properly fitting different constraints of the HCC problem. Consequently, a generator was proposed dealing with all kinds of constraints such as time window constraints, workload constraints, synchronization, and precedence constraints. This generator allows researchers to validate and compare solving methods on a common dataset regardless of confidentiality issues. We validated our generator by firstly creating a common benchmark available for researchers and secondly by proposing a set of instances and a solving method based on an HHC problem found in the literature.

Parcel delivery cost minimization with time window constraints using trucks and drones

Networks ◽  
2021 ◽  
Author(s):  
Marc‐Antoine Coindreau ◽  
Olivier Gallay ◽  
Nicolas Zufferey
Keyword(s):  
Time Window ◽  
Cost Minimization ◽  
Delivery Cost ◽  
Time Window Constraints
Sign in / Sign up

Export Citation Format

Share Document