Leisten Rainer

Rainer Leisten

Information about the author Rainer Leisten will soon be added to the site.
Found 15 papers in total
Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
2017
In this paper, we propose two new heuristic tie‐breaking rules in the...
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
2010
In this paper, an extensive review of recently published papers on hybrid flow shop...
Comparison of heuristics for flowtime minimisation in permutation flowshops
Comparison of heuristics for flowtime minimisation in permutation flowshops
2005
In this paper, we address the problem of sequencing jobs in a permutation flow shop...
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
2003
The polynomial heuristic of Nawaz/Enscore/Ham (NEH) is one of the best heuristics to...
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
2002
In this paper we analyse the performance of flowshop sequencing heuristics with...
Sequencing constant work-in progress (CONWIP) flow-shops: Analysis and heuristics
Sequencing constant work-in progress (CONWIP) flow-shops: Analysis and heuristics
2001
In this paper, we address the backlog sequencing problem in a flow-shop controlled by...
Input control and dispatching rules in a dynamic constant work-in-process flow-shop
Input control and dispatching rules in a dynamic constant work-in-process flow-shop
2000
The purpose of this paper is to study the input control and dispatching rules that...
Convergence aspects of adaptive clustering in variable aggregation
Convergence aspects of adaptive clustering in variable aggregation
1999
A convergent iterative aggregation procedure is described. The procedure makes use of...
A note on scheduling jobs with missing operations in permutation flow shops
A note on scheduling jobs with missing operations in permutation flow shops
1998
Flowshop scheduling problems are usually handled as permutation flowshops because of...
An LP-aggregation view on aggregation in multi-level production planning
An LP-aggregation view on aggregation in multi-level production planning
1998
Multi-level production planning systems often suppose a top level which anticipates a...
Decomposition and iterative aggregation in hierarchical and decentralised planning structures
Decomposition and iterative aggregation in hierarchical and decentralised planning structures
1995
The interpretation of decomposition approaches, originally developed for the solution...
A posteriori error bounds in linear programming aggregation
A posteriori error bounds in linear programming aggregation
1997
A major topic in aggregation of linear programming problems is the estimation of the...
Aggregation and decomposition for multi-divisional linear programs
Aggregation and decomposition for multi-divisional linear programs
1994
This paper proposes the use of linear programming aggregation theory to study...
Linear programming aggregation: A heuristic for hierarchical production planning
Linear programming aggregation: A heuristic for hierarchical production planning
1995
The authors present an aggregation/disaggregation approach to hierarchical production...
Flowshop sequencing problems with limited buffer storage
Flowshop sequencing problems with limited buffer storage
1990
Sequencing problems and especially flowshop sequencing problems have been broadly...
Papers per page: