A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1007/s10951-022-00731-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4226299618 / rank | |||
Normal rank | |||
Latest revision as of 02:47, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general scheme for solving a large set of scheduling problems with rejection in FPT time |
scientific article |
Statements
A general scheme for solving a large set of scheduling problems with rejection in FPT time (English)
0 references
27 May 2022
0 references
scheduling with rejection
0 references
fixed parameter tractable
0 references
single machine
0 references
parallel machines
0 references
flow-shop
0 references
\( \mathcal{NP} \)-hard
0 references
