Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073)
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: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness |
scientific article; zbMATH DE number 6654041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness |
scientific article; zbMATH DE number 6654041 |
Statements
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (English)
0 references
17 November 2016
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
neh
0 references
pfsp
0 references
maximum tardiness
0 references
makespan
0 references
bounded insertion
0 references
non-population algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8631154298782349
0 references
0.8356349468231201
0 references
0.8333500623703003
0 references
0.8282111287117004
0 references
