A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (Q2490218)
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 branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert |
scientific article; zbMATH DE number 5021296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert |
scientific article; zbMATH DE number 5021296 |
Statements
A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (English)
0 references
28 April 2006
0 references
Sequencing
0 references
Single machine
0 references
Branch-and-Bound method
0 references
Maximum earliness
0 references
Maximum tardiness
0 references
Idle insert
0 references
0 references
0 references
0.8954214453697205
0 references
0.8896555304527283
0 references
0.8824148178100586
0 references
0.8823197484016418
0 references
