A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039): 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 / describes a project that uses
 
Property / describes a project that uses: minpack / 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.cor.2007.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967566448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming for scheduling surface mount technology lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with no in-process buffers / 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: Q5422204 / 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: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains / 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: Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal versus heuristic scheduling of surface mount technology lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for determining the optimal price discrimination / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:57, 28 June 2024

scientific article
Language Label Description Also known as
English
A memetic algorithm for the flexible flow line scheduling problem with processor blocking
scientific article

    Statements

    A memetic algorithm for the flexible flow line scheduling problem with processor blocking (English)
    0 references
    0 references
    0 references
    7 November 2008
    0 references
    flexible flow line
    0 references
    processor blocking
    0 references
    memetic algorithms
    0 references
    variable neighbourhood search
    0 references
    0 references
    0 references

    Identifiers