A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines (Q1718886): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59068681 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Krill herd / 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.1155/2014/654053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988315591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model for Fleet Sizing and Vehicle Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics based on Bin Packing for the line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling just-in-time part supply for mixed-model assembly lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive two-agent scheduling with learning effect and release times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-agent single-machine scheduling problem with learning and deteriorating considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing-based krill herd algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi objective optimization of coordinated scheduling of cranes and vehicles at container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: U-shaped assembly line balancing problem with genetic algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:35, 18 July 2024

scientific article
Language Label Description Also known as
English
A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines
scientific article

    Statements

    A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: Different aspects of assembly line optimization have been extensively studied. Part feeding at assembly lines, however, is quite an undeveloped area of research. This study focuses on the optimization of part feeding at mixed-model assembly lines with respect to the Just-In-Time principle motivated by a real situation encountered at one of the major automobile assembly plants in Spain. The study presents a mixed integer linear programming model and a novel simulated annealing algorithm-based heuristic to pave the way for the minimization of the number of tours as well as inventory level. In order to evaluate the performance of the algorithm proposed and validate the mathematical model, a set of generated test problems and two real-life instances are solved. The solutions found by both the mathematical model and proposed algorithm are compared in terms of minimizing the number of tours and inventory levels, as well as a performance measure called workload variation. The results show that although the exact mathematical model had computational difficulty solving the problems, the proposed algorithm provides good solutions in a short computational time.
    0 references

    Identifiers