The prize-collecting scheduling problem with deadlines (Q510929): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2016.10.015 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.10.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2549642359 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Machine Scheduling by Column Generation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey on offline scheduling with rejection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem / rank | |||
Normal 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
