A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (Q1762161)

From MaRDI portal
Revision as of 00:10, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
scientific article

    Statements

    A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    flexible job shop scheduling problem with transportation
    0 references
    bounded processing times
    0 references
    genetic algorithm
    0 references
    tabu search
    0 references
    flexible manufacturing system
    0 references
    robotic cell
    0 references
    surface treatment facility
    0 references
    disjunctive graph
    0 references