Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1640601
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wen-Jie Li / 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.07.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019355540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / 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: Online Scheduling with Hard Deadlines / 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 on a single machine: Maximizing the number of early jobs / 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: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A look-ahead heuristic for scheduling jobs with release dates on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in batch machine scheduling / 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: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much can lookahead help in online single machine scheduling / rank
 
Normal rank

Latest revision as of 03:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
scientific article

    Statements

    Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    online scheduling
    0 references
    deadline
    0 references
    lookahead
    0 references
    parallel batch
    0 references

    Identifiers