A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags |
scientific article; zbMATH DE number 5137718
| 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; zbMATH DE number 5137718 |
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
0 references
0 references
0 references
0 references
0 references
