``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.ejor.2010.05.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987679716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees for Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On different approximation criteria for subset product problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General approximation algorithms for some arithmetical combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime numbers and computer methods for factorization. / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:48, 3 July 2024

scientific article
Language Label Description Also known as
English
``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation
scientific article

    Statements

    ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (English)
    0 references
    0 references
    9 September 2010
    0 references
    0 references
    complexity theory
    0 references
    scheduling
    0 references
    subset product
    0 references
    FPTAS
    0 references
    systems reliability
    0 references
    0 references