Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q187128
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: George Steiner / 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/s10951-009-0109-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081401598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain scheduling: sequence coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873242 / 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: Integrated Scheduling of Production and Distribution Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithm for job sequencing with deadlines / 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: The coordination of scheduling and batch deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: Minimizing the weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with deliveries to multiple customer locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling in a two-level supply chain -- a focus on the supplier / rank
 
Normal rank
Property / cites work
 
Property / cites work: BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(&lt;Special Issue&gt;Advanced Planning and Scheduling for Supply Chain Management) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated supply chain management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Algorithm for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures / rank
 
Normal rank

Latest revision as of 12:14, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
scientific article

    Statements

    Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (English)
    0 references
    0 references
    0 references
    8 March 2010
    0 references
    supply chain
    0 references
    scheduling
    0 references
    batching
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references

    Identifiers