Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203): 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.1080/00207721.2013.876679 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999512942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan for two batch-processing machines with non-identical job sizes in job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results on simulated annealing applied to the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization combined with taboo search for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental analysis of local minima to improve neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic algorithms: Foundations and applications. International symposium, SAGA 2001, Berlin, Germany, December 13--14, 2001. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast TS/SA algorithm for the job shop scheduling problem / rank
 
Normal rank

Latest revision as of 13:34, 11 July 2024

scientific article
Language Label Description Also known as
English
Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
scientific article

    Statements

    Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (English)
    0 references
    8 March 2016
    0 references
    permutation
    0 references
    slack time
    0 references
    fictitious slack time
    0 references
    infeasible schedule
    0 references
    feasible schedule
    0 references

    Identifiers