Comparison based on hard instances from [79].

<div><p>The hybrid flow-shop scheduling problem is widely present and applied in industries such as production, manufacturing, transportation, and aerospace. In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful com...

Full description

Saved in:

Bibliographic Details
Main Author:	Xiang Tian (4369285) (author)
Other Authors:	Yang Kong (3376658) (author), Xiyu Liu (1700959) (author)
Published:	2025
Subjects:	Science Policy Environmental Sciences not elsewhere classified Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Chemical Sciences not elsewhere classified Information Systems not elsewhere classified work firstly proposes unrelated parallel machines shop scheduling problem identical parallel machines fully parallel processing constraint programming modeling level probe operations 9 representative algorithms probe libraries tailored improved probe machine scenario hfs problems probe machine data libraries wait scenario standard scenario xlink "> widely present results demonstrate recent years real cases promising applications nonlinear access large number including hfs hybrid flow data preprocessing compared algorithms
Tags:	Add Tag No Tags, Be the first to tag this record!

Comparison based on hard instances from [79].

Similar Items