Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3934/mbe.2022414 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4285297534 / rank | |||
Normal rank | |||
Revision as of 02:49, 20 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
