Single-machine total completion time scheduling with a time-dependent deterioration (Q534948): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apm.2010.09.028 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886561 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
single-machine
Property / zbMATH Keywords: single-machine / rank
 
Normal rank
Property / zbMATH Keywords
 
time-dependent
Property / zbMATH Keywords: time-dependent / rank
 
Normal rank
Property / zbMATH Keywords
 
deteriorating jobs
Property / zbMATH Keywords: deteriorating jobs / rank
 
Normal rank
Property / zbMATH Keywords
 
total completion time
Property / zbMATH Keywords: total completion time / 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.apm.2010.09.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007991225 / 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: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING / 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: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with a learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling of simple linear deteriorating jobs / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variation of Flow Time in Single Machine Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APM.2010.09.028 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Single-machine total completion time scheduling with a time-dependent deterioration
scientific article

    Statements

    Single-machine total completion time scheduling with a time-dependent deterioration (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    scheduling
    0 references
    single-machine
    0 references
    time-dependent
    0 references
    deteriorating jobs
    0 references
    total completion time
    0 references

    Identifiers