A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem (Q3895231): 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.1287/mnsc.26.3.274 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159446692 / rank | |||
Normal rank | |||
Revision as of 18:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem |
scientific article |
Statements
A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem (English)
0 references
1980
0 references
two duty period scheduling problem
0 references
0-1 constraint coefficients
0 references
Lagrangean relaxation
0 references
subgradient optimization
0 references
computational results
0 references
large problems
0 references
