Scheduling on same-speed processors with at most one downtime on each machine (Q429662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048240 / rank
 
Normal rank
Property / zbMATH Keywords
 
multiprocessor scheduling
Property / zbMATH Keywords: multiprocessor scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
LPT
Property / zbMATH Keywords: LPT / rank
 
Normal rank
Property / zbMATH Keywords
 
downtimes
Property / zbMATH Keywords: downtimes / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed jobs
Property / zbMATH Keywords: fixed jobs / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case bounds
Property / zbMATH Keywords: worst-case bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
makespan
Property / zbMATH Keywords: makespan / rank
 
Normal rank
Property / zbMATH Keywords
 
machine shutdowns
Property / zbMATH Keywords: machine shutdowns / rank
 
Normal rank
Property / zbMATH Keywords
 
availability constraints
Property / zbMATH Keywords: availability constraints / 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.disopt.2010.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004225867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact upper bound for the Multifit processor scheduling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / 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 availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithm for scheduling on two identical machines with machine availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machines scheduling with nonsimultaneous machine available time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machines scheduling with machine shutdowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of machine availability on the worst-case performance of LPT / 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: Q4198056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
Scheduling on same-speed processors with at most one downtime on each machine
scientific article

    Statements

    Scheduling on same-speed processors with at most one downtime on each machine (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    0 references
    multiprocessor scheduling
    0 references
    LPT
    0 references
    downtimes
    0 references
    fixed jobs
    0 references
    worst-case bounds
    0 references
    makespan
    0 references
    machine shutdowns
    0 references
    availability constraints
    0 references
    0 references