Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58644692, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with a single breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with flexible and periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with a restricted rate-modifying activity / 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: Single machine flow-time scheduling with scheduled maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / 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: Machine scheduling with a rate-modifying activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling under potential disruption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of job completion times on capacitated parallel machines / 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: 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: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank

Latest revision as of 08:44, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
scientific article

    Statements

    Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (English)
    0 references
    0 references
    0 references
    26 October 2010
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    planned downtimes
    0 references
    flow-time
    0 references
    pre-emption
    0 references

    Identifiers