A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A generalized class-teacher model for some timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some special types of timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling open shops with parallel machines / rank
 
Normal rank

Revision as of 18:58, 2 July 2024

scientific article
Language Label Description Also known as
English
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
scientific article

    Statements

    A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2010
    0 references
    preemptive open shop scheduling
    0 references
    multiprocessor operations
    0 references
    linear programming
    0 references

    Identifiers