A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766)
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: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem |
scientific article; zbMATH DE number 2117416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem |
scientific article; zbMATH DE number 2117416 |
Statements
A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (English)
0 references
22 November 2004
0 references
Scheduling
0 references
Permutation flow-shop
0 references
No-idle machines
0 references
Travelling salesman problem
0 references
Nearest insertion rule
0 references
0 references
