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 Concept Videos

Optimal Foraging00:48

Optimal Foraging

14.1K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
14.1K
Inclusive Fitness00:57

Inclusive Fitness

42.9K
Most altruistic behavior—in which one animal helps another at a cost to themselves—occurs between relatives. Scientists think these altruistic behaviors evolved because they increase the inclusive fitness of the animal providing help.
42.9K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

375
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
375
Combinatorial Gene Control02:33

Combinatorial Gene Control

9.8K
Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
9.8K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.3K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.3K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.8K
3.8K

You might also read

Related Articles

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

Sort by
Same author

Efficacy of 0.01% atropine for myopia control in children: an artificial intelligence-assisted multivariate Bayesian meta-analysis.

Frontiers in medicine·2026
Same author

Survey of pediatric solid tumor care in economically underdeveloped regions of China.

BMC health services research·2026
Same author

Low-Light Image Enhancement Based on Nanoscale Stochastic Magnetic Tunnel Junctions.

ACS applied materials & interfaces·2026
Same author

Development of a LightGBM-based survival prediction model for major burn patients using LDH/LYM ratio as the core predictor.

Burns : journal of the International Society for Burn Injuries·2026
Same author

Saturated absorption frequency stabilization of VCSELs based on high-temperature operation.

Applied optics·2026
Same author

Humanoid Robot-Assisted Support for Health Care in Older Adults: Systematic Scoping Review.

JMIR aging·2026

Related Experiment Video

Updated: Mar 3, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.5K

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.

Qianwang Deng1, Guiliang Gong1, Xuran Gong1

  • 1State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body, Hunan University, Changsha 410082, China.

Computational Intelligence and Neuroscience
|May 2, 2017
PubMed
Summary

A novel algorithm, bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II), optimizes the complex flexible job-shop scheduling problem (FJSP). This approach effectively minimizes completion time, machine workload, and total workload for improved scheduling efficiency.

More Related Videos

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.3K
A Quantitative Fitness Analysis Workflow
11:39

A Quantitative Fitness Analysis Workflow

Published on: August 13, 2012

15.0K

Related Experiment Videos

Last Updated: Mar 3, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.5K
The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.3K
A Quantitative Fitness Analysis Workflow
11:39

A Quantitative Fitness Analysis Workflow

Published on: August 13, 2012

15.0K

Area of Science:

  • Operations Research
  • Computer Science
  • Artificial Intelligence

Background:

  • The flexible job-shop scheduling problem (FJSP) is a complex, NP-hard optimization challenge.
  • FJSP inherits characteristics from the traditional job-shop scheduling problem (JSP), requiring sophisticated solution methods.

Purpose of the Study:

  • To develop and evaluate a novel algorithm, BEG-NSGA-II, for solving the multiobjective FJSP (MO-FJSP).
  • The study aims to minimize three key objectives: makespan, maximum machine workload, and total workload.

Main Methods:

  • A two-stage optimization mechanism is employed, integrating NSGA-II with a bee evolutionary guiding scheme.
  • The first stage uses NSGA-II with a bee evolutionary scheme for extensive solution space exploration.
  • The second stage refines solutions using NSGA-II with a specialized updating mechanism to prevent premature convergence.

Main Results:

  • Numerical simulations were conducted using published benchmark instances for MO-FJSP.
  • The BEG-NSGA-II algorithm demonstrated effectiveness in finding Pareto-optimal solutions.
  • Comparative analysis showed superior performance against existing well-known algorithms.

Conclusions:

  • The proposed BEG-NSGA-II algorithm is effective for addressing multiobjective flexible job-shop scheduling problems.
  • The hybrid approach enhances search capabilities and avoids premature convergence, leading to better scheduling outcomes.
  • BEG-NSGA-II offers a promising advancement in solving complex scheduling optimization tasks.