Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-021-00793-3 / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00793-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3194595331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on identical machines with agreement graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-machine flow-shop scheduling with a conflict graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts: Online and offline algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nontrivial path covers of graphs: existence, minimization and maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / 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: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit-time tasks in renewable resource constrained flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problem with conflict graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-021-00793-3 / rank
 
Normal rank

Latest revision as of 03:44, 17 December 2024

scientific article
Language Label Description Also known as
English
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
scientific article

    Statements

    Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2022
    0 references
    path cover
    0 references
    flow-shop scheduling
    0 references
    conflict graph
    0 references
    \(b\)-matching
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers