A scheduling problem with job values given as a power function of their completion times (Q954933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing maximum lateness under linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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 the total weighted completion time with a constraint on the release time resource consumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform machine scheduling of unit-time jobs subject to resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under simple linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with a variable common due date and resource-dependent processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Problem with a Quadratic Cost Function of Completion Times / 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

Revision as of 19:31, 28 June 2024

scientific article
Language Label Description Also known as
English
A scheduling problem with job values given as a power function of their completion times
scientific article

    Statements

    A scheduling problem with job values given as a power function of their completion times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    branch and bound
    0 references
    heuristic
    0 references
    experimental analysis
    0 references

    Identifiers