A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126643388, #quickstatements; #temporary_batch_1719410179150 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126643388 / rank | |||
Normal rank | |||
Latest revision as of 15:57, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem |
scientific article |
Statements
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (English)
0 references
2 April 2001
0 references
scheduling
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
