Approximation schemes for parallel machine scheduling with availability constraints (Q642981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030975628 / 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: Q3181697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential inapproximability and FPTAS for scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / 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: Approximability of scheduling with fixed jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of single machine scheduling with fixed jobs to minimize total completion time / rank
 
Normal rank

Latest revision as of 14:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for parallel machine scheduling with availability constraints
scientific article

    Statements

    Approximation schemes for parallel machine scheduling with availability constraints (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    0 references
    PTAS
    0 references
    inapproximability
    0 references
    parallel machine
    0 references
    total weighted completion time
    0 references
    0 references