Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Li-Qi Zhang / rank
Normal rank
 
Property / author
 
Property / author: Li-Qi Zhang / 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.2010.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073617864 / 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: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / 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: 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: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
scientific article

    Statements

    Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    scheduling
    0 references
    deteriorating job
    0 references
    non-availability constraint
    0 references
    fully polynomial-time approximation scheme
    0 references

    Identifiers