Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q494075 / rank
Normal rank
 
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972282966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized class-teacher model for some timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / 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: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Complexity of scheduling multiprocessor tasks with prespecified processors allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with dedicated processors: applications of fractional graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:53, 1 July 2024

scientific article
Language Label Description Also known as
English
Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
scientific article

    Statements

    Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    preemptive open shop scheduling
    0 references
    multiprocessor operations
    0 references
    polynomial time algorithms
    0 references

    Identifiers