Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints

DOI10.1016/J.EJOR.2018.05.048MaRDI QIDQ1653370zbMATH OpenOpenAlexWikidataFDO

Authors Alberto García-Villoria, Albert Corominas, Adrià Nadal, Rafael Pastor

Publication date 3 August 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/122134

zbMATH Keywords

assembly line balancingmanufacturingaccessibility windowsmatheuristic procedure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Production models (90B30)

Recommendations

• Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
• A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• ASALBP: the alternative subgraphs assembly line balancing problem

Cites work

• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• A classification of assembly line balancing problems
• A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• A survey on problems and methods in generalized assembly line balancing
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
• An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
• Assembly-Line Balancing by Linear Programming
• Combinatorial Benders cuts for assembly line balancing problems with setups
• Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Exact and heuristic methods for solving the robotic assembly line balancing problem
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Improved integer programming models for simple assembly line balancing and related problems
• Moving policies in cyclic assembly line scheduling
• Procedures for the time and space constrained assembly line balancing problem
• Second order conic approximation for disassembly line design with joint probabilistic constraints
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

Cited in

(6)

• Assembly line balancing: what happened in the last fifteen years?
• Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
• A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)

This page was built for publication: Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653370)