Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Genetic algorithms, path relinking, and the flowshop sequencing problem.

C R Reeves1, T Yamada

  • 1School of Mathematical and Information Sciences, Coventry University, United Kingdom. C.Reeves@coventry.ac.uk

Evolutionary Computation
|February 18, 1999
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Genetically engineered analogs of ascomycin for nerve regeneration.

The Journal of pharmacology and experimental therapeutics·2002
Same author

[A case of staphylococcal enterocolitis caused by methicillin resistant Staphylococcus aureus].

Hinyokika kiyo. Acta urologica Japonica·1992
Same author

[Primary carcinoma in situ of the ureter: a case report].

Hinyokika kiyo. Acta urologica Japonica·1992
Same author

[Significance of normal oral flora, particularly group oral streptococci as defense mechanism against infection in healthy individuals (normal defense mechanism by oral Streptococcus group)].

Kansenshogaku zasshi. The Journal of the Japanese Association for Infectious Diseases·1992
Same author

[Coronet status of digital radiography in chest medicine].

Nihon Kyobu Shikkan Gakkai zasshi·1992
Same author

Characterization of H2 histamine receptor: linkage to both adenylate cyclase and [Ca2+]i signaling systems.

The American journal of physiology·1992
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

This study enhances a genetic algorithm (GA) for optimizing job flow in manufacturing. By analyzing operator-generated landscapes, the improved GA significantly boosts performance in permutation flowshop sequencing problems (PFSP).

Area of Science:

  • Operations Research
  • Computer Science
  • Industrial Engineering

Background:

  • The permutation flowshop sequencing problem (PFSP) is critical for optimizing manufacturing efficiency.
  • Previous genetic algorithms (GAs) showed comparable performance to other methods for PFSP.
  • Tabu search methods have recently demonstrated superior performance in solving PFSP.

Purpose of the Study:

  • To improve the performance of a genetic algorithm (GA) for the n-job, m-machine permutation flowshop sequencing problem (PFSP).
  • To investigate the impact of operator-generated landscape features on GA performance for PFSP.

Main Methods:

  • Revisiting and refining a previously developed genetic algorithm (GA).
  • Incorporating analysis of the problem's solution landscape features generated by GA operators.

Related Experiment Videos

  • Evaluating the enhanced GA against existing methods for PFSP.

    • Main Results:

    • The enhanced genetic algorithm (GA) demonstrates significantly improved performance for the PFSP.
    • Understanding and utilizing landscape features leads to better optimization outcomes.
    • The refined GA offers a competitive alternative to tabu search for PFSP.

    Conclusions:

    • A refined genetic algorithm (GA) can achieve superior performance in permutation flowshop sequencing problems (PFSP).
    • Analyzing the solution landscape is crucial for optimizing evolutionary algorithms.
    • This work provides an improved GA approach for complex scheduling challenges.