Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem (Q2450763): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2013.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999341779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line integrated production-distribution scheduling problems with capacitated deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line supply chain scheduling problems with preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Production and Outbound Distribution Scheduling: Review and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Scheduling: Batching and Delivery / rank
 
Normal rank

Latest revision as of 12:15, 8 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
scientific article

    Statements

    Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem (English)
    0 references
    0 references
    0 references
    15 May 2014
    0 references
    supply chain scheduling
    0 references
    on-line algorithm
    0 references
    competitive analysis
    0 references
    integrated production-distribution problems
    0 references

    Identifiers