A comment on scheduling two parallel machines with capacity constraints (Q2581321): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2005.06.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014770281 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation algorithm for scheduling two parallel machines with capacity constraints. / rank | |||
Normal rank | |||
Latest revision as of 14:50, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comment on scheduling two parallel machines with capacity constraints |
scientific article |
Statements
A comment on scheduling two parallel machines with capacity constraints (English)
0 references
9 January 2006
0 references
parallel machine scheduling
0 references
approximation algorithm
0 references
approximation scheme
0 references
0 references
