Time slot scheduling of compatible jobs (Q880586): 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: Jérôme Monnot / rank
Normal rank
 
Property / author
 
Property / author: Vangelis Th. Paschos / rank
Normal rank
 
Property / author
 
Property / author: Jérôme Monnot / rank
 
Normal rank
Property / author
 
Property / author: Vangelis Th. Paschos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986115514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Master-slave strategy and polynomial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum independent sets by excluding subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-slot assignment for TDMA-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with some additional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic scheduling and frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of the edge precoloring extension problem on bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring weighted bipartite graphs with a co-site constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coloring for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum coloring problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling batches with simultaneous job processing for two-machine shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of decomposing matrices arising in satellite communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Solutions for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Time slot scheduling of compatible jobs
scientific article

    Statements

    Time slot scheduling of compatible jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Weighted coloring
    0 references
    Chromatic scheduling
    0 references
    Approximations
    0 references
    Edge coloring
    0 references
    Batch scheduling
    0 references
    0 references