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 forma recombination in permutation flowshop problems.

C Cotta1, J M Troya

  • 1Departamento de Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, Universidad de Málaga, Málaga, Spain. ccottap@lcc.uma.es

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

[Late metastases of malignant choroidal melanoma after curietherapy: two case reports].

Journal francais d'ophtalmologie·2004
Same author

[Acting out in nurses].

Soins. Psychiatrie·1994
Same author

[To rediscover liberty under constraint?].

Soins. Psychiatrie·1992
Same author

[Efficacy of the electrocardiographic diagnosis of left ventricular hypertrophy on the basis of gender].

Revista portuguesa de cardiologia : orgao oficial da Sociedade Portuguesa de Cardiologia = Portuguese journal of cardiology : an official journal of the Portuguese Society of Cardiology·1990
Same author

[Arrhythmia in chronic respiratory insufficiency].

Revista portuguesa de cardiologia : orgao oficial da Sociedade Portuguesa de Cardiologia = Portuguese journal of cardiology : an official journal of the Portuguese Society of Cardiology·1990
Same author

[Rothmund syndrome and syndermatotic cataracts].

Bulletin des societes d'ophtalmologie de France·1985
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 evaluates representations for permutation flowshop problems, finding that task positions are key for makespan optimization. New recombination operators focusing on these positions show competitive performance.

Area of Science:

  • Operations Research
  • Computer Science
  • Artificial Intelligence

Background:

  • Permutation flowshop scheduling problems (PFSP) are complex combinatorial optimization challenges.
  • Effective representation of solutions is crucial for developing efficient algorithms.
  • Makespan minimization is a primary objective in flowshop scheduling.

Purpose of the Study:

  • To analyze various representations for permutation flowshop problems.
  • To assess the impact of different representations on makespan optimization.
  • To propose and evaluate novel recombination operators.

Main Methods:

  • Forma analysis was employed to evaluate solution representations.
  • Classical recombination operators were empirically tested.

Related Experiment Videos

  • New operators were designed and benchmarked against existing methods.

    • Main Results:

    • Representations emphasizing the absolute positions of tasks yielded superior performance.
    • New operators demonstrated competitive results compared to traditional approaches.
    • The proposed operators showed specific properties in implicit mutation and forma transmission.

    Conclusions:

    • The choice of representation significantly impacts makespan optimization in PFSP.
    • Task position-based representations are highly effective.
    • Novel recombination operators offer a promising alternative for PFSP.