The prize-collecting scheduling problem with deadlines (Q510929): 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.endm.2016.10.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2016.10.015 / rank | |||
Normal rank | |||
Latest revision as of 19:53, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The prize-collecting scheduling problem with deadlines |
scientific article |
Statements
The prize-collecting scheduling problem with deadlines (English)
0 references
14 February 2017
0 references
single machine scheduling
0 references
total tardiness
0 references
integer linear programming
0 references
hard deadlines
0 references
branch and bound
0 references
