Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Flexible Flow Line"”.

  1. Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling

    Previous research on scheduling flexible flow lines (FFL) to minimize makespan has utilized approaches such as branch and bound, integer programming, or heuristics. Metaheuristic methods have attracted increasing interest for solving scheduling problems in the past few years. Particle swarm …

    clemson Repository record for Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling (opens in a new tab)

  2. Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times

    … Algorithm (RKGA) for scheduling optimization in flexible flow line manufacturing with sequence dependent setup times. The proposed RKGA representation decodes scheduling information independently at each stage, unlike the traditional RKGA, which is only sequenced based on the first stage, …

    clemson Repository record for Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times (opens in a new tab)

  3. A Particle Swarm Optimization Using Random Keys For Flexible Flow Shop Scheduling Problem With Sequence Dependent Setup Times

    … (PSO) using random keys is developed to schedule flexible flow lines with sequence dependent setup times to minimize makespan. The flexible flow line scheduling problem is a branch of production scheduling and is found in industries such as printed circuit board and automobile manufacturing. It is …

    clemson Repository record for A Particle Swarm Optimization Using Random Keys For Flexible Flow Shop Scheduling Problem With Sequence Dependent Setup Times (opens in a new tab)