A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02522667.1987.10698896 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2327107442 / rank | |||
Normal rank | |||
Revision as of 22:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure |
scientific article |
Statements
A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (English)
0 references
1987
0 references
bicriterion scheduling
0 references
single machine
0 references
range of lateness
0 references
maximum lateness
0 references
branch-and-bound
0 references
