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
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
