An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
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.1016/j.orl.2007.08.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2004033524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Machine scheduling with resource dependent processing times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4821303 / rank | |||
Normal rank |
Latest revision as of 13:08, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation algorithm for identical parallel machine scheduling with resource dependent processing times |
scientific article |
Statements
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (English)
0 references
6 August 2008
0 references
scheduling
0 references
resource constraints
0 references
multiple choice knapsack
0 references