Optimally competitive list batching (Q837154): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1006042
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wolfgang W. Bein / 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.1016/j.tcs.2009.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032752940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing Total Tardiness in a Serial Batching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a chemical batch scheduling problem by local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling with deadlines on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch sizing and job sequencing on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line analysis of the TCP acknowledgment delay problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the remote server problem or more about TCP acknowledgments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on a single machine: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic TCP acknowledgment in the LogP model / 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: A class of on-line scheduling algorithms to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs that arrive over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank

Latest revision as of 22:36, 1 July 2024

scientific article
Language Label Description Also known as
English
Optimally competitive list batching
scientific article

    Statements

    Optimally competitive list batching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    design of algorithms
    0 references
    online algorithms
    0 references
    batching
    0 references
    TCP acknowledgment
    0 references

    Identifiers