Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.tcs.2014.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976110695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine scheduling subject to nonnegative inventory constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for inventory constrained scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to nonrenewable-resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated scheduling of production and delivery with production window and delivery capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling problems with financial resource constraints: some complexity results and properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic scheduling problems with raw material constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for single machine scheduling with non-renewable resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stock Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered knapsack and applications to scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with inventory constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm for the machine scheduling problem with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling under a Non-renewable Resource Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling under the job rejection constraint / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:07, 9 July 2024

scientific article
Language Label Description Also known as
English
Reductions between scheduling problems with non-renewable resources and knapsack problems
scientific article

    Statements

    Reductions between scheduling problems with non-renewable resources and knapsack problems (English)
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation preserving reductions
    0 references
    scheduling problems
    0 references
    knapsack problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references