A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2014.11.103 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2014.11.103 / rank | |||
Normal rank | |||
Latest revision as of 13:44, 9 December 2024
scientific article
| 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 |
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
