Moving policies in cyclic assembly line scheduling

DOI10.1016/j.tcs.2005.10.023zbMath1086.90026OpenAlexW2111810282WikidataQ57013294 ScholiaQ57013294MaRDI QIDQ820155

Karsten Weihe, Matthias Müller-Hannemann

Publication date: 6 April 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.023

zbMATH Keywords

assembly line balancingprinted circuit boardscycle-time minimizationfast component mountersfixed-parameter analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Assembly line balancing: what happened in the last fifteen years? ⋮ 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) ⋮ Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints ⋮ A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)

Cites Work

• Production planning problems in printed circuit board assembly
• Faster exact algorithms for hard problems: A parameterized point of view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Moving policies in cyclic assembly line scheduling