A simulated annealing algorithm for single machine scheduling problems with family setups (Q1013384): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.cor.2008.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036831982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch set-up times to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness with job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 12:26, 1 July 2024

scientific article
Language Label Description Also known as
English
A simulated annealing algorithm for single machine scheduling problems with family setups
scientific article

    Statements

    A simulated annealing algorithm for single machine scheduling problems with family setups (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    0 references
    single machine
    0 references
    family setups
    0 references
    simulated annealing
    0 references
    neighborhood property
    0 references
    0 references