Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1093/imaman/dpm016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048426633 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 5221253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search |
scientific article; zbMATH DE number 5221253 |
Statements
Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (English)
0 references
18 December 2007
0 references
scheduling problems
0 references
variable neighbourhood search
0 references
GRASP
0 references
