Armin Scholl
According to our database1,
Armin Scholl
authored at least 39 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
1
1
1
1
1
4
2
2
4
5
2
1
2
1
1
2
2
3
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines.
Eur. J. Oper. Res., January, 2024
2023
E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles.
Eur. J. Oper. Res., 2023
2022
Eur. J. Oper. Res., 2022
2021
SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing.
Eur. J. Oper. Res., 2021
2019
Eur. J. Oper. Res., 2019
2017
2013
The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics.
OR Spectr., 2013
The discrete forward-reserve problem - Allocating space, selecting products, and area sizing in forward order picking.
Eur. J. Oper. Res., 2013
Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing.
Eur. J. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
Eur. J. Oper. Res., 2012
2011
On the part inventory model sequencing problem: complexity and Beam Search heuristic.
J. Sched., 2011
2010
OR Spectr., 2010
Eur. J. Oper. Res., 2010
Discret. Appl. Math., 2010
2009
A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times.
Eur. J. Oper. Res., 2009
The product rate variation problem and its relevance in real world mixed-model assembly lines.
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure.
Eur. J. Oper. Res., 2009
Ann. Oper. Res., 2009
2008
OR Spectr., 2008
2007
2006
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing.
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
2005
Solving multiattribute design problems with analytic hierarchy process and conjoint analysis: An empirical comparison.
Eur. J. Oper. Res., 2005
2002
Proceedings of the Operations Research Proceedings 2002, 2002
2000
PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem.
Math. Methods Oper. Res., 2000
1999
Eur. J. Oper. Res., 1999
Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling.
Eur. J. Oper. Res., 1999
1998
Pattern Based Vocabulary Building for Effectively Sequencing Mixed-Model Assembly Lines.
J. Heuristics, 1998
1997
INFORMS J. Comput., 1997
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem.
Comput. Oper. Res., 1997
1992