A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126643388, #quickstatements; #temporary_batch_1719410179150 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(98)00081-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987468199 / rank | |||
Normal rank | |||
Latest revision as of 08:52, 30 July 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
