Parallel-machine scheduling of simple linear deteriorating jobs (Q837167): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
Normal rank
 
Property / author
 
Property / author: Cheng, T. C. Edwin / 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.2009.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039048057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with simple linear deterioration to minimize total completion time / 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: Q4714493 / 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: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank

Latest revision as of 22:37, 1 July 2024

scientific article
Language Label Description Also known as
English
Parallel-machine scheduling of simple linear deteriorating jobs
scientific article

    Statements

    Parallel-machine scheduling of simple linear deteriorating jobs (English)
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    parallel-machine scheduling
    0 references
    computational complexity
    0 references
    worst-case bound
    0 references
    makespan
    0 references
    total machine load
    0 references

    Identifiers

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