On the machine scheduling problem with job delivery coordination (Q884029): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Machine scheduling with job delivery coordination / 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: 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: Improved algorithms for two single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm / rank
 
Normal rank

Latest revision as of 20:05, 25 June 2024

scientific article
Language Label Description Also known as
English
On the machine scheduling problem with job delivery coordination
scientific article

    Statements

    Identifiers