Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times |
scientific article |
Statements
Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (English)
0 references
3 March 2023
0 references
minmax scheduling
0 references
common due-window
0 references
deterioration effect
0 references
