Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
type: Item
instance of: scholarly article
title: Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
zbMATH Open document ID: 1403.90287
author: Alberto García-Villoria
author: Albert Corominas
author: Adrià Nadal
author: Rafael Pastor
published in: European Journal of Operational Research
publication date: 2018-08-03T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/122134
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6913722
zbMATH Keywords: manufacturing
zbMATH Keywords: assembly line balancing
zbMATH Keywords: accessibility windows
zbMATH Keywords: matheuristic procedure
MaRDI profile type: Publication
OpenAlex ID: W2804261579
cites work: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
cites work: Combinatorial Benders cuts for assembly line balancing problems with setups
cites work: Procedures for the time and space constrained assembly line balancing problem
cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
cites work: A survey on problems and methods in generalized assembly line balancing
cites work: Second order conic approximation for disassembly line design with joint probabilistic constraints
cites work: Exact and heuristic methods for solving the robotic assembly line balancing problem
cites work: Assembly-Line Balancing by Linear Programming
cites work: A classification of assembly line balancing problems
cites work: Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
cites work: Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
cites work: An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
cites work: A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
cites work: Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
cites work: An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
cites work: Moving policies in cyclic assembly line scheduling
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Improved integer programming models for simple assembly line balancing and related problems
cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
Wikidata QID: Q129753438
DOI: 10.1016/J.EJOR.2018.05.048
description: scientific article; zbMATH DE number 6913722