A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time (Q4367055)
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 1091266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time |
scientific article; zbMATH DE number 1091266 |
Statements
A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time (English)
0 references
5 April 1998
0 references
NP-hard single-machine problem
0 references
\(n\) independent jobs
0 references
earliness-tardiness problem
0 references
branch-and-bound
0 references
0.9183604121208192
0 references
0.8932443261146545
0 references
0.884968638420105
0 references
0.8824148178100586
0 references
