What type of study is this?

This is a Literature Review study.

August 26, 2025Applied SciencesOpen Access

The Estimation Distribution Algorithm for the Blocking Job Shop Scheduling Problem

View Full Paper

Ask AI

Bookmark

Authors

This algorithm improves solution quality for the blocking job shop problem, suggesting effective assignment probabilities.

The proposed estimation distribution algorithm enhances solution quality for blocking job shop scheduling.
Improvements include better diversity in generated solutions using assignment probabilities in the EDA.
The algorithm operates within the feasible solution space, crucial for NP-hard problems like BJSSP.
Runtime ranged from 20 seconds for 10 jobs to 600 seconds for 30 jobs across problem sets.

VALENCIA et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark