Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-010-0193-x / rank
Normal rank
 
Property / author
 
Property / author: Jean-Claude Konig / rank
Normal rank
 
Property / author
 
Property / author: Jean-Claude Konig / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087854645 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.02202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for scheduling identical coupled tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 8/7-approximation algorithm for (1,2)-TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian Completion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the path cover problem on circular-arc graphs by using an approximation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum path cover of a distance-hereditary graph in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the Hamiltonian completion number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical coupled task scheduling: polynomial complexity of the cyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal covering of cacti by vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-optimal solution for the path cover problem on cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of coupled-task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling coupled tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs and bipartite permutation graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-010-0193-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:59, 18 December 2024

scientific article
Language Label Description Also known as
English
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
scientific article

    Statements

    Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    coupled-tasks
    0 references
    complexity
    0 references
    compatibility graph
    0 references
    polynomial-time approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references