Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.03.012 / 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.03.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005313518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with a single breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling preemptable tasks on parallel processors with limited availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-preemptive two-machine open shop scheduling with non-availability constraints / 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: Two-machine flow shops with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for flow shop scheduling problems with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs and maintenance activities on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with scheduled maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with machine availability and eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.03.012 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Exponential inapproximability and FPTAS for scheduling with availability constraints
scientific article

    Statements

    Exponential inapproximability and FPTAS for scheduling with availability constraints (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2009
    0 references
    inapproximability
    0 references
    FPTAS
    0 references
    machine availability
    0 references
    total weighted completion time
    0 references
    scheduling
    0 references

    Identifiers