Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030): 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 / 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.ejor.2008.03.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058996863 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57185750 / 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 independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / 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: Two-machine flow shops with limited machine availability / 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: Capacitated two-parallel machines scheduling to minimize sum of job completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / 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 on semi-identical processors / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:44, 2 July 2024

scientific article
Language Label Description Also known as
English
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
scientific article

    Statements

    Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    scheduling problem
    0 references
    availability constraints
    0 references
    parallel machines
    0 references
    total completion times
    0 references

    Identifiers