Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q418765
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sheng Yu / 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.2013.02.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014135121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / 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: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Deteriorating Jobs on a Single Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for single-machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheduling problem with job values given as a power function of their completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single machine scheduling to minimize total general completion time / 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: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Machine Scheduling With Linear Deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with simple linear deterioration on a single machine / 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: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for parallel machine scheduling with simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' / rank
 
Normal rank

Latest revision as of 03:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
scientific article

    Statements

    Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (English)
    0 references
    0 references
    0 references
    11 December 2013
    0 references
    online scheduling
    0 references
    competitive analysis
    0 references
    simple linear deterioration
    0 references
    total general completion time
    0 references
    single machine
    0 references
    release time
    0 references
    0 references
    0 references
    0 references

    Identifiers