Andreas Fink
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andreas Fink has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Fabian Lang
Helmut Schmidt University Hamburg
2 shared publications - Guido Schryen
Paderborn University
2 shared publications - Jörg Homberger
Hochschule für Technik Stuttgart
2 shared publications - Natalia Kliewer
Department of Information Systems, Freie Universität Berlin, Berlin, Germany
2 shared publications - Andrea Raiconi
Istituto per le Applicazioni del Calcolo “Mauro Picone” (Naples Unit), National Research Council, Via Pietro Castellino 111, 80131 Naples, Italy
1 shared publication Jens Czogalla
Helmut-Schmidt-University/UniBw Hamburg
1 shared publication
Latest Publications
- 25 November 2019
- Published by Springer Nature in Business & Information Systems Engineering
- Vol. 62 (1) , 21-23
Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges”
- 25 November 2019
- Published by Springer Nature in Business & Information Systems Engineering
- Vol. 62 (1) , 21-23
Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges”
- 11 November 2019
- Published by Springer Nature in Business & Information Systems Engineering
- Vol. 62 (1) , 1-3
High Performance Business Computing
- 11 November 2019
- Published by Springer Nature in Business & Information Systems Engineering
- Vol. 62 (1) , 1-3
High Performance Business Computing
- 22 April 2014
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 24 (2) , 299-332
Learning from the Metaheuristics: Protocols for Automated Negotiations
- 22 April 2014
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 24 (2) , 299-332
Learning from the Metaheuristics: Protocols for Automated Negotiations
- 15 April 2012
- Published by Springer Nature in Evolving Systems
- Vol. 3 (3) , 189-201
Negotiating in dynamic environments: time-efficient automated negotiations by means of combinatorial auctions
- 15 April 2012
- Published by Springer Nature in Evolving Systems
- Vol. 3 (3) , 189-201
Negotiating in dynamic environments: time-efficient automated negotiations by means of combinatorial auctions
- 31 January 2012
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 25 (1-2) , 94-121
An ant-based coordination mechanism for resource-constrained project scheduling with multiple agents and cash flow objectives
- 31 January 2012
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 25 (1-2) , 94-121
An ant-based coordination mechanism for resource-constrained project scheduling with multiple agents and cash flow objectives
- 4 October 2011
- Published by IGI Global Scientific Publishing
- p. 137-157
A Hybrid Particle Swarm Algorithm for Resource-Constrained Project Scheduling
The authors present and analyze a particle swarm optimization (PSO) approach for the resource-constrained project scheduling problem (RCPSP). It incorporates well-known procedures such as the serial schedule generation scheme and it is hybridized with forward-backward improvement. The authors investigate the application of PSO in comparison to state-of-the-art methods from the literature. They conduct extensive computational experiments using a benchmark set of problem instances. The reported results demonstrate that the proposed hybrid particle swarm optimization approach is competitive. They significantly improve previous results of PSO for the RCPSP and provide new overall best average results for the medium size data set. Furthermore, the authors provide insights into the importance of crucial components for achieving high-quality results.
- 4 October 2011
- Published by IGI Global Scientific Publishing
- p. 137-157
A Hybrid Particle Swarm Algorithm for Resource-Constrained Project Scheduling
The authors present and analyze a particle swarm optimization (PSO) approach for the resource-constrained project scheduling problem (RCPSP). It incorporates well-known procedures such as the serial schedule generation scheme and it is hybridized with forward-backward improvement. The authors investigate the application of PSO in comparison to state-of-the-art methods from the literature. They conduct extensive computational experiments using a benchmark set of problem instances. The reported results demonstrate that the proposed hybrid particle swarm optimization approach is competitive. They significantly improve previous results of PSO for the RCPSP and provide new overall best average results for the medium size data set. Furthermore, the authors provide insights into the importance of crucial components for achieving high-quality results.
- 28 April 2009
- Published by Springer Nature
- p. 99-126
Design and Analysis of Evolutionary Algorithms for the No-wait Flow-shop Scheduling Problem
- 28 April 2009
- Published by Springer Nature
- p. 99-126
Design and Analysis of Evolutionary Algorithms for the No-wait Flow-shop Scheduling Problem
- 1 January 2009
- Published by Springer Nature
- p. 253-278
Mathematical Formulations and Metaheuristics Comparison for the Push-Tree Problem
- 1 January 2009
- Published by Springer Nature
- p. 253-278
Mathematical Formulations and Metaheuristics Comparison for the Push-Tree Problem