Online unbounded batch scheduling on parallel machines with delivery times (Q2354308): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1782040
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-014-9706-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988187934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online batch scheduling on parallel machines with delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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 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: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines / 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: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines / 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: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times / 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 11:46, 10 July 2024

scientific article
Language Label Description Also known as
English
Online unbounded batch scheduling on parallel machines with delivery times
scientific article

    Statements

    Online unbounded batch scheduling on parallel machines with delivery times (English)
    0 references
    0 references
    0 references
    10 July 2015
    0 references
    scheduling
    0 references
    online algorithm
    0 references
    batch machines
    0 references
    delivery times
    0 references
    competitive ratio
    0 references

    Identifiers