A single-machine scheduling with a truncated linear deterioration and ready times (Q497952): 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.ins.2013.08.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033161932 / 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: Scheduling start time dependent jobs to minimize the total weighted completion time / 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 note on single-processor scheduling with time-dependent execution times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017560 / 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: The complexity of scheduling starting time dependent tasks with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with step-deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with piecewise linear decreasing processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine sequencing with linear models of release dates / 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: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with start time dependent processing times: Some solvable cases / 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: Flow shop scheduling problems with deteriorating jobs under dominating machines / 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: Single machine group scheduling under decreasing linear deterioration / rank
 
Normal rank

Latest revision as of 20:22, 10 July 2024

scientific article
Language Label Description Also known as
English
A single-machine scheduling with a truncated linear deterioration and ready times
scientific article

    Statements

    A single-machine scheduling with a truncated linear deterioration and ready times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2015
    0 references
    scheduling
    0 references
    single-machine
    0 references
    deteriorating job
    0 references
    ant colony
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references

    Identifiers