Linear time approximation scheme for the multiprocessor open shop problem (Q5954097): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for the multiprocessor open shop scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4852849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short Shop Schedules / rank | |||
Normal rank |
Latest revision as of 22:33, 3 June 2024
scientific article; zbMATH DE number 1698523
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear time approximation scheme for the multiprocessor open shop problem |
scientific article; zbMATH DE number 1698523 |
Statements
Linear time approximation scheme for the multiprocessor open shop problem (English)
0 references
10 December 2002
0 references
scheduling
0 references
open shop
0 references
approximation scheme
0 references