官方服务：
资源简介：
A n × m = 4 × 2 FSSP.
应用场景：
创建时间：
2020-12-02
相关数据集
Computational Results for the article titled as - Valid Inequalities for No-Wait Permutation Flowshop Scheduling Problems
This file contains the computational results for the article titled "Valid Inequalities for No-Wait Permutation Flowshop Scheduling Problems". There are 3 excels files representing the results for mak
Mendeley Data80
Data for: Iterated Greedy methods for the distributed permutation flowshop scheduling problem
Online materials for the paper Iterated Greedy methods for the distributed permutation flowshop scheduling problem
Mendeley Data2024-06-25 更新60
Experimental data - A Co-evolutionary Genetic Algorithm for the Two-machine Flow Shop Group Scheduling Problem with Job-related Blocking and Transportation Times
The experimental data (File format: txt) used to support the findings of this study are included within the supplementary information file(s).
NIAID Data Ecosystem30
Synthetic dataset for the flow-shop problem (FS_DS_01)
Synthetic dataset containing setup and processing times for a flow-shop problem of 1.000 parts and 200 machines.
NIAID Data Ecosystem60
Buffer Allocation Problem in production flow lines: a new Benders-decomposition-based exact solution approach
The buffer allocation problem (BAP) in production flow lines is very relevant from a practical point of view and very challenging from a scientific perspective. For this reason, it has drawn great att
Taylor & Francis Group2021-04-26 更新40
