The complexity of two supply chain scheduling problems (Q2444850): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Supply Chain Scheduling: Batching and Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated supply chain management / rank
 
Normal rank

Latest revision as of 15:15, 7 July 2024

scientific article
Language Label Description Also known as
English
The complexity of two supply chain scheduling problems
scientific article

    Statements

    The complexity of two supply chain scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    manufacturing and scheduling
    0 references
    supply chains
    0 references
    NP-complete
    0 references
    0 references