Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-016-0083-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2526083655 / 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: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / 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: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with linear deteriorating jobs to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines / rank
 
Normal rank

Latest revision as of 13:22, 14 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling to minimize the total weighted completion time plus the rejection cost
scientific article

    Statements

    Online scheduling to minimize the total weighted completion time plus the rejection cost (English)
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    online scheduling
    0 references
    single machine
    0 references
    online algorithms
    0 references
    total weighted completion time
    0 references
    rejection cost
    0 references

    Identifiers