Strong NP-hardness of scheduling problems with learning or aging effect (Q363599): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6203958 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
flowshop
Property / zbMATH Keywords: flowshop / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine
Property / zbMATH Keywords: single machine / rank
 
Normal rank
Property / zbMATH Keywords
 
learning effect
Property / zbMATH Keywords: learning effect / rank
 
Normal rank
Property / zbMATH Keywords
 
aging effect
Property / zbMATH Keywords: aging effect / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / 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.1007/s10479-013-1364-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966570709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with position dependent job processing times: computational complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: On single processor scheduling problems with learning dependent on the number of processed jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with both deterioration and learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with time and position dependent processing times / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:25, 6 July 2024

scientific article
Language Label Description Also known as
English
Strong NP-hardness of scheduling problems with learning or aging effect
scientific article

    Statements

    Strong NP-hardness of scheduling problems with learning or aging effect (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2013
    0 references
    0 references
    scheduling
    0 references
    flowshop
    0 references
    single machine
    0 references
    learning effect
    0 references
    aging effect
    0 references
    computational complexity
    0 references
    0 references