Parallel dedicated machines scheduling with chain precedence constraints (Q1926857): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling three chains on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A job-shop problem with one additional resource type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost multi-product flow lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-Numerical Approach to Production Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of properties of different precedence graphs for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of shop-scheduling problems with fixed number of jobs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Model and a Graphical Algorithm for a Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3598877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for unrelated machine scheduling with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel dedicated machines under a single non-shared resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on unrelated machines under tree-like precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Akers-Friedman Scheduling Problem / rank
 
Normal rank

Latest revision as of 01:31, 6 July 2024

scientific article
Language Label Description Also known as
English
Parallel dedicated machines scheduling with chain precedence constraints
scientific article

    Statements

    Parallel dedicated machines scheduling with chain precedence constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    scheduling
    0 references
    parallel dedicated machines
    0 references
    precedence constraints
    0 references
    two-job job shop
    0 references
    computational complexity
    0 references
    0 references