Shifting representation search for hybrid flexible flowline problems (Q992723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.ejor.2010.05.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142809705 / 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: Q2770544 / 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: Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of flexible flow line scheduling procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling realistic hybrid flexible flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search in Complex Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Shifting representation search for hybrid flexible flowline problems
scientific article

    Statements

    Shifting representation search for hybrid flexible flowline problems (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2010
    0 references
    hybrid flexible flowline
    0 references
    realistic scheduling
    0 references
    precedence constraints
    0 references
    setup times
    0 references
    time lags
    0 references
    local search
    0 references
    0 references
    0 references
    0 references

    Identifiers