Flow-shop scheduling for three serial stations with the last two duplicate

Bolat, Ahmet; Al-Harkan, Ibrahim M.; Alharbi, Bandar

doi:10.1016/j.cor.2003.08.010

Cited by 13 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this specific case, the earliest known B&B algorithm was proposed by [155]. Much later, [21] studied the same problem and approached it with B&B, heuristics, and genetic algorithms. Another exact method for this problem, but without waiting allowed between the two stages is given in [61].…”

Section: Exact Algorithmsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

642

231

View full text Add to dashboard Cite

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Exact Algorithmsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

642

231

View full text Add to dashboard Cite

show abstract

“…The alterations are biologically-derived techniques, commonly achieved by inheritance, mutation and crossover. Multiple genetic algorithms were designed for mixed model assembly lines such as [14], [15], [16] and [17].…”

Section: Genetic Algorithmmentioning

confidence: 99%

Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers

Färber

Moreno

2006

Computational Science and Its Applications - ICCSA 2006

View full text Add to dashboard Cite

This paper presents the performance study of a Genetic Algorithm applied to a mixed model non-permutation flowshop production line. Resequencing is permitted where stations have access to intermittent or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. Characteristics such as the difference between the intermittent and the centralized case, the number of buffer places and the distribution of the buffer places are analyzed. Improvements that come with the introduction of constrained resequencing buffers are highlighted.

show abstract

“…The current solutions to the hybrid workshop scheduling problem include accurate calculations for low-complexity and small-scale problems [2][3][4] and heuristic algorithms. Due to accurate calculation, the calculation time increases exponentially with the complexity of the workshop scheduling problem and the application value is limited.…”

Section: Introductionmentioning

confidence: 99%

Parallel Hybrid Particle Swarm Algorithm for Workshop Scheduling Based on Spark

2021

View full text Add to dashboard Cite

In hybrid mixed-flow workshop scheduling, there are problems such as mass production, mass manufacturing, mass assembly and mass synthesis of products. In order to solve these problems, combined with the Spark platform, a hybrid particle swarm algorithm that will be parallelized is proposed. Compared with the existing intelligent algorithms, the parallel hybrid particle swarm algorithm is more conducive to the realization of the global optimal solution. In the loader manufacturing workshop, the optimization goal is to minimize the maximum completion time and a parallelized hybrid particle swarm algorithm is used. The results show that in the case of relatively large batches, the parallel hybrid particle swarm algorithm can effectively obtain the scheduling plan and avoid falling into the local optimal solution. Compared with algorithm serialization, algorithm parallelization improves algorithm efficiency by 2–4 times. The larger the batches, the more obvious the algorithm parallelization improves computational efficiency.

show abstract

Flow-shop scheduling for three serial stations with the last two duplicate

Cited by 13 publications

References 17 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers

Parallel Hybrid Particle Swarm Algorithm for Workshop Scheduling Based on Spark

Contact Info

Product

Resources

About