R
Rainer Leisten
Researcher at University of Duisburg-Essen
Publications - 61
Citations - 2321
Rainer Leisten is an academic researcher from University of Duisburg-Essen. The author has contributed to research in topics: Flow shop scheduling & Scheduling (production processes). The author has an hindex of 22, co-authored 61 publications receiving 2150 citations. Previous affiliations of Rainer Leisten include University of Bergen & Heidelberg University.
Papers
More filters
Journal ArticleDOI
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
TL;DR: An extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented and the papers are classified first according to the HFS characteristics and production limitations considered in the respective papers and then according toThe solution approach proposed.
Journal ArticleDOI
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
TL;DR: This paper reviews and classify the main contributions regarding this topic and discusses future research issues on makespan minimization in permutation flow-shop scheduling.
Journal ArticleDOI
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
Jose M. Framinan,Rainer Leisten +1 more
TL;DR: In this article, the authors proposed a heuristic for mean/total flowtime minimization in permutation flow shops, which exploits the idea of optimising partial schedules, already present in the NEH-heuristic (Omega 11 (1983) 91) with respect to makespan minimisation.
Journal ArticleDOI
Flowshop sequencing problems with limited buffer storage
TL;DR: In this article, a systematic overview of how to formulate flow shop problems with limited buffer storage as well as several heuristics to compete with this class of problems are presented. But usually the effect of limited buffer storages is ignored, although in industrial production or computer architecture the amount of available buffer storage has an important influence on the performance of the system.
Journal ArticleDOI
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
TL;DR: The polynomial heuristic of Nawaz/Enscore/Ham (NEH) is one of the best heuristics to minimize makespan in static-deterministic permutation flowshop problems as discussed by the authors.