GA-ACO in Job-Shop Schedule Problem Research (Q3058969): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-16388-3_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2276218655 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A genetic algorithm for the flexible job-shop scheduling problem / rank | |||
Normal rank | |||
Latest revision as of 13:52, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GA-ACO in Job-Shop Schedule Problem Research |
scientific article |
Statements
GA-ACO in Job-Shop Schedule Problem Research (English)
0 references
7 December 2010
0 references
job-shop scheduling
0 references
genetic algorithm
0 references
single-parent reproduction
0 references
ant colony algorithm
0 references
dynamic integration
0 references
