Optimal on-line algorithms for one batch machine with grouped processing times (Q411231): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xi-wen Lu / rank
Normal rank
 
Property / author
 
Property / author: Xi-wen Lu / 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/s10878-010-9298-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066466881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / 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: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling algorithms for a batch machine with finite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling with delivery time on a single batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank

Latest revision as of 01:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimal on-line algorithms for one batch machine with grouped processing times
scientific article

    Statements

    Optimal on-line algorithms for one batch machine with grouped processing times (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2012
    0 references
    0 references
    batching
    0 references
    scheduling
    0 references
    on-line algorithm
    0 references
    delivery time
    0 references
    0 references