A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246): 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.1016/j.ejor.2006.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984745113 / rank | |||
Normal rank | |||
Revision as of 01:40, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags |
scientific article |
Statements
A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (English)
0 references
27 March 2007
0 references
scheduling
0 references
one machine
0 references
makespan
0 references
branch and bound algorithm
0 references
minimum and maximum time lags
0 references
