Non-approximability of just-in-time scheduling (Q1041346): 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 / 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/s10951-009-0120-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995157101 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57013245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with earliness, tardiness and non-execution penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the average deviation of job completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimizing the total weighted tardiness on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine problem with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties / rank
 
Normal rank

Latest revision as of 06:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Non-approximability of just-in-time scheduling
scientific article

    Statements

    Non-approximability of just-in-time scheduling (English)
    0 references
    2 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    single machine scheduling
    0 references
    earliness
    0 references
    tardiness
    0 references
    just-in-time
    0 references
    non-approximability
    0 references
    special cases
    0 references
    0 references
    0 references