Preemptive scheduling with simple linear deterioration on a single machine (Q708208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2010.05.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969746719 / 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: Q3885495 / 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: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How useful are preemptive schedules? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with time dependent processing times / 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: Due-date assignment and single machine scheduling with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / 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: Scheduling linear deteriorating jobs with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / 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: 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: Complexity analysis of job-shop scheduling with deteriorating jobs / 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: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank

Latest revision as of 08:10, 3 July 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling with simple linear deterioration on a single machine
scientific article

    Statements

    Preemptive scheduling with simple linear deterioration on a single machine (English)
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    scheduling
    0 references
    linear deterioration
    0 references
    preemption
    0 references
    release dates
    0 references
    regular function
    0 references
    0 references
    0 references
    0 references
    0 references