Scheduling parallel machines with inclusive processing set restrictions (Q3518727): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users 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.1002/nav.20286 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072712212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4247460 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:24, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling parallel machines with inclusive processing set restrictions |
scientific article |
Statements
Scheduling parallel machines with inclusive processing set restrictions (English)
0 references
11 August 2008
0 references
scheduling
0 references
parallel machines
0 references
worst-case analysis
0 references
polynomial time approximation scheme
0 references
