A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5499934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness |
scientific article; zbMATH DE number 5499934 |
Statements
A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (English)
0 references
29 January 2009
0 references
0 references
0 references
0.8387465476989746
0 references
0.7984734773635864
0 references
0.7922936081886292
0 references
0.7732412815093994
0 references
