Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / 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: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithm for job sequencing with deadlines / 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: Scheduling linear deteriorating jobs with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with periodic maintenance to minimize makespan / 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: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with availability constraints / 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
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain partnership for three-echelon deteriorating inventory model / rank
 
Normal rank

Latest revision as of 23:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for scheduling a maintenance and linear deteriorating jobs
scientific article

    Statements

    Approximation schemes for scheduling a maintenance and linear deteriorating jobs (English)
    0 references
    0 references
    0 references
    16 June 2017
    0 references
    scheduling
    0 references
    complexity
    0 references
    approximation scheme
    0 references
    deteriorating job
    0 references
    maintenance
    0 references

    Identifiers