OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING (Q4903636): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of small open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank

Latest revision as of 03:42, 6 July 2024

scientific article; zbMATH DE number 6128409
Language Label Description Also known as
English
OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
scientific article; zbMATH DE number 6128409

    Statements

    OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING (English)
    0 references
    0 references
    0 references
    24 January 2013
    0 references
    scheduling
    0 references
    batch processing machines
    0 references
    flow shop
    0 references
    online algorithm
    0 references

    Identifiers