A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761)
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 method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization |
scientific article; zbMATH DE number 6595835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization |
scientific article; zbMATH DE number 6595835 |
Statements
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (English)
0 references
21 June 2016
0 references
scheduling
0 references
single machine
0 references
maximum delivery time
0 references
non-availability constraint
0 references
0 references
