A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1836169
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-004-5031-0 / rank
Normal rank
 
Property / author
 
Property / author: Wen-Ci Yu / 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/s10479-004-5031-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993201768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729097 / 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: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-004-5031-0 / rank
 
Normal rank

Latest revision as of 10:27, 11 December 2024

scientific article
Language Label Description Also known as
English
A flexible on-line scheduling algorithm for batch machine with infinite capacity
scientific article

    Statements

    A flexible on-line scheduling algorithm for batch machine with infinite capacity (English)
    0 references
    0 references
    0 references
    22 April 2005
    0 references
    scheduling
    0 references
    batch
    0 references
    makespan
    0 references
    on-line
    0 references
    unbounded capacity
    0 references

    Identifiers