Parallel variable neighbourhood search algorithms for job shop scheduling problems (Q5432691): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1093/imaman/dpm009 / rank | |||
| 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.1093/imaman/dpm009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095820716 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1093/IMAMAN/DPM009 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:59, 30 December 2024
scientific article; zbMATH DE number 5221254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel variable neighbourhood search algorithms for job shop scheduling problems |
scientific article; zbMATH DE number 5221254 |
Statements
Parallel variable neighbourhood search algorithms for job shop scheduling problems (English)
0 references
18 December 2007
0 references
variable neighbourhood search
0 references
parallel neighbourhood search
0 references
job shop scheduling
0 references
