Batch processing with interval graph compatibilities between tasks (Q2476244): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with bipartite compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling on a single batch processing machine with split compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 19:44, 27 June 2024

scientific article
Language Label Description Also known as
English
Batch processing with interval graph compatibilities between tasks
scientific article

    Statements

    Batch processing with interval graph compatibilities between tasks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2008
    0 references
    batch-scheduling
    0 references
    task compatibilities
    0 references
    interval graphs
    0 references
    perfect graphs
    0 references
    bounded coloring
    0 references
    Max-coloring
    0 references

    Identifiers