NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554)
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: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness |
scientific article; zbMATH DE number 6650878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness |
scientific article; zbMATH DE number 6650878 |
Statements
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (English)
0 references
10 November 2016
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
neh
0 references
tie-breaking mechanism
0 references
tardiness
0 references
PFSP
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8365545272827148
0 references
0.8338643312454224
0 references
0.8323552012443542
0 references
0.8271600008010864
0 references
0.8267133831977844
0 references
