A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan (Q2369202): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.07.042 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978209048 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A genetic algorithm for flowshop sequencing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On general routing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The particle swarm optimization algorithm: Convergence analysis and parameter selection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems / rank | |||
Normal rank |
Revision as of 12:17, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan |
scientific article |
Statements
A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan (English)
0 references
28 April 2006
0 references