Rainer Leisten

According to our database1, Rainer Leisten authored at least 15 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops.
Algorithms, 2019

2016
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime.
Expert Syst. Appl., 2016

2015
Variability of completion time differences in permutation flow shop scheduling.
Comput. Oper. Res., 2015

2014
Manufacturing Scheduling Systems - An Integrated View on Models, Methods and Tools.
Springer, ISBN: 978-1-4471-6271-1, 2014

2010
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective.
Comput. Oper. Res., 2010

2008
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria.
OR Spectr., 2008

2005
A review and classification of heuristics for permutation flow-stop scheduling with makespan objective.
J. Oper. Res. Soc., 2005

Mechanisms for Coordination of Master Planning and lot sizing within a Hierarchical production Planning Model.
Int. J. Comput., 2005

Comparison of heuristics for flowtime minimisation in permutation flowshops.
Comput. Oper. Res., 2005

2004
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective.
J. Oper. Res. Soc., 2004

2002
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation.
Eur. J. Oper. Res., 2002

Innovationscontrolling in Supply Networks.
Proceedings of the Modelle im E-Business, 2002

1999
Convergence aspects of adaptive clustering in variable aggregation.
Comput. Oper. Res., 1999

1998
An LP-aggregation view on aggregationin multi-level production planning.
Ann. Oper. Res., 1998

1997
<i>A posteriori</i> error bounds in linear programming aggregation.
Comput. Oper. Res., 1997


  Loading...