Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00186-008-0270-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070165484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: Some Conditions of Macroeconomic Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the complexities of approximation algorithms for optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / 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

Latest revision as of 04:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
scientific article

    Statements

    Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (English)
    0 references
    0 references
    0 references
    25 November 2009
    0 references
    scheduling
    0 references
    input-output model
    0 references
    dynamic programming
    0 references
    fully polynomial time approximation scheme
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references