Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties |
scientific article; zbMATH DE number 6951743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties |
scientific article; zbMATH DE number 6951743 |
Statements
Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (English)
0 references
11 October 2018
0 references
single machine scheduling
0 references
sequence-dependent setup times
0 references
VNS
0 references
0.7991502285003662
0 references
0.7969938516616821
0 references
0.7952703833580017
0 references
0.7797475457191467
0 references
