A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / 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: Scheduling jobs under decreasing linear deterioration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with deteriorating jobs under dominating machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto and scalar bicriterion optimization in scheduling deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in a two-machine flow shop with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in a contaminated area: a model and polynomial algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling problems with decreasing linear deterioration under dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs subject to job or machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-machine scheduling with deteriorating jobs and scheduled maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling tasks with time-dependent execution times / 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: 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: Single machine scheduling to minimize weighted earliness subject to no tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling start time dependent jobs to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling problems with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimal control in a single machine problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource optimal control in some single-machine scheduling problems / rank
 
Normal rank

Revision as of 18:35, 2 July 2024

scientific article
Language Label Description Also known as
English
A note on single-machine scheduling with decreasing time-dependent job processing times
scientific article

    Statements

    A note on single-machine scheduling with decreasing time-dependent job processing times (English)
    0 references
    0 references
    2 May 2010
    0 references
    scheduling
    0 references
    single-machine
    0 references
    time-dependent processing times
    0 references
    resource allocation
    0 references
    0 references

    Identifiers