Scheduling resource allocation with timeslot penalty for changeover (Q861274): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A competitive analysis of the list update problem with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online scheduling of parallel jobs with dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010317 / rank
 
Normal rank

Revision as of 11:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Scheduling resource allocation with timeslot penalty for changeover
scientific article

    Statements

    Scheduling resource allocation with timeslot penalty for changeover (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    online scheduling
    0 references
    changeover cost
    0 references
    resource allocation
    0 references
    wireless scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references