A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times

Eskandari, Hamidreza; Hosseinzadeh, A.

doi:10.1057/jors.2013.70

Cited by 18 publications

(11 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They also developed a MILP model with the objectives of minimizing the total weighted tardiness and makespan. Eskandari and Hosseinzadeh [20] investigated the HFSP by considering rework with the makespan objective. A variable neighborhood search (VNS) with several heuristic approaches was applied to the problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time

Yılmaz,

Yeni

2024

JIMO

View full text Add to dashboard Cite

In this paper, a multi-objective hybrid flowshop scheduling problem (HFSP) with limited waiting time and machine capability constraints is addressed. Given its importance, the implementation of lot streaming division methodologies with the problem is investigated through a design of experiment (DoE) setting based on real data extracted from a leading tire manufacturer in Gebze, Turkey. By doing so, specific characteristics of the addressed HFSP can be further explored to provide insights into its complexity and suggest recommendations for improving the operational efficiency of such systems resembling it. Based on the problem specifications and constraints, a novel generic multi-objective optimization model with objectives including the makespan, the average flow time, and the total workload imbalance is formulated. Since the studied problem is NP-hard in the strong sense, several algorithms based on the non-dominated sorting genetic algorithm-II (NSGA-II) are proposed according to the division methodologies, i.e., consistent sublots and equal sublots. Since the main aim of this problem is to further analyze the implementation of lot streaming on the HFSP problem, the developed algorithms are compared with each other to gain remarkable insights into the problem. Four different comparison metrics are employed to assess the solution quality of the proposed algorithms in terms of intensification and diversification aspects. Computational results demonstrate that employing the consistent sublot methodology leads to significant improvements in all metrics compared to the equal sublot methodology.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time

Yılmaz,

Yeni

2024

JIMO

View full text Add to dashboard Cite

show abstract

“…Eq. (16) shows the branch population algorithm generated by the ant traffic method. In the equation, τOOz PxyP ij and τROz P ij M k W l are the sequence pheromone and the resource pheromone, respectively.…”

Section: Design Of Branch Population Genetic Algorithmmentioning

confidence: 99%

“…Recent years saw the emergence of artificial intelligence methods like metaheuristic algorithm [15,16], local search algorithm [17], binary particle swarm optimization [18,19], and multi-objective tabu search algorithm [20,21]. In spite of some achievements, these methods are subject to certain limitations.…”

Section: Introductionmentioning

confidence: 99%

Optimization Algorithm Simulation for Dual-Resource Constrained Job-Shop Scheduling

Yue¹,

Tang²

2018

Int. j. simul. model.

View full text Add to dashboard Cite

This research aims to optimize the job-shop scheduling constrained by manpower and machine under complex manufacturing conditions. To this end, a branch population genetic algorithm was presented based on compressed time-window scheduling strategy, and optimized with elite evolution and fanshaped roulette operator. Specifically, the compressed time-window scheduling strategy was proposed to meet the two optimization targets: the maximum makespan and the total processing cost. Then, the elite evolution and fan-shaped roulette operator were introduced to simplify the global and local search, enhance the capacity of branch population genetic algorithm, and suppress the early elimination of inferior solutions, thus preventing the algorithm from falling into the local optimal solution. Finally, the rationality and feasibility of the proposed algorithm were verified through a simulation test. The simulation results show that the proposed algorithm lowered the maximum makespan and total processing cost by 7.4 % and 4.7 %, respectively, from the level of the original branch population genetic algorithm. This means the compressed time-window scheduling strategy can significantly optimize the makespan and the cost, as well as the robustness and global search ability.

show abstract

“…petri net, branch and bound, and integer programming), heuristic methods (genetic algorithms, Tabu search, simulated annealing, and nature-inspired metaheuristics), and other approaches such as agent methods. [6][7][8][9][10][11] However, researchers are still searching for methods to decrease the complexity of computations in this field. Recently, the application of cellular automata to solve scheduling problems has been described in the literature.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

Algebraic-logical meta-model based approach for scheduling manufacturing problem with defects removal

Kucharska

Grobler-Dębska

Rączka

2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

The article deals with a formal approach to solving manufacturing problem with defects removal and presents the application of this approach to flow-shop system with defects. The defects are detected during quality control and thus they are unexpected events. Moreover, a job processing time is not predetermined, and it may contain the unknown time needed to repair. Therefore, stochastic uncertainties are considered, but in addition, we model the process of decision making. The algebraic-logical meta-model methodology constitutes the basis for our approach. A hybrid algorithm for constructing a solution based on the process simulation using special local optimizing task and algebraic-logical models switching when defect detection occurs is presented. In particular, the following elements of the presented approach are shown: disturbances type analyzing, definition of switching states set, definition of subproblems, algebraic-logical metamodels creating for all subproblems, switching types determining, determination of the switching rules, the switching function, and components of special local criterion definition. The article shows results of computer experiments.

show abstract

A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times

Cited by 18 publications

References 30 publications

Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time

Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time

Optimization Algorithm Simulation for Dual-Resource Constrained Job-Shop Scheduling

Algebraic-logical meta-model based approach for scheduling manufacturing problem with defects removal

Contact Info

Product

Resources

About