scispace - formally typeset
Search or ask a question
Author

Stefan Helber

Bio: Stefan Helber is an academic researcher from Leibniz University of Hanover. The author has contributed to research in topics: Scheduling (production processes) & Job shop scheduling. The author has an hindex of 25, co-authored 56 publications receiving 1784 citations. Previous affiliations of Stefan Helber include Clausthal University of Technology & Ludwig Maximilian University of Munich.


Papers
More filters
Journal ArticleDOI
TL;DR: A review of four decades of research on dynamic lot-sizing with capacity constraints shows that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice.
Abstract: This paper presents a review of four decades of research on dynamic lot-sizing with capacity constraints. We discuss both different modeling approaches to the optimization problems and different algorithmic solution approaches. The focus is on research that separates the lot-sizing problem from the detailed sequencing and scheduling problem. Our conceptional point of reference is the multi-level capacitated lot-sizing problem (MLCLSP). We show how different streams of research emerged over time. One result is that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice. Our review also shows that currently mathematical programing and the use of metaheuristics are particularly popular among researchers in a vivid and flourishing field of research.

270 citations

Journal ArticleDOI
TL;DR: This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times and its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler.

168 citations

Journal ArticleDOI
TL;DR: In this paper, a fix-and-optimize algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L) is presented.

166 citations

Posted Content
TL;DR: In this article, an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times is presented. But the solution quality is not as good as those of Tempelmeier/Derstroff and Stadtler.
Abstract: This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables The remaining binary setup variables are tentatively fixed to values determined in previous iterations The resulting algorithm is transparent, flexible, accurate and relatively fast Its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler

153 citations

Journal ArticleDOI
TL;DR: The proposed procedure uses a modification of the Dixon-Silver heuristic to solve a sequence of single-level capacitated multi-item lotsizing problems (CLSP).

97 citations


Cited by
More filters
Journal ArticleDOI
01 May 1975
TL;DR: The Fundamentals of Queueing Theory, Fourth Edition as discussed by the authors provides a comprehensive overview of simple and more advanced queuing models, with a self-contained presentation of key concepts and formulae.
Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

2,562 citations

Journal ArticleDOI
TL;DR: The evolution of ECMPRO that has taken place in the last decade is discussed and the new areas that have come into focus during this time are discussed.

911 citations

Journal ArticleDOI
TL;DR: A survey of the recent literature on call center operations management can be found in this article, where the authors identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.
Abstract: Call centers are an increasingly important part of today's business world, employing millions of agents across the globe and serving as a primary customer-facing channel for firms in many different industries. Call centers have been a fertile area for operations management researchers in several domains, including forecasting, capacity planning, queueing, and personnel scheduling. In addition, as telecommunications and information technology have advanced over the past several years, the operational challenges faced by call center managers have become more complicated. Issues associated with human resources management, sales, and marketing have also become increasingly relevant to call center operations and associated academic research. In this paper, we provide a survey of the recent literature on call center operations management. Along with traditional research areas, we pay special attention to new management challenges that have been caused by emerging technologies, to behavioral issues associated with both call center agents and customers, and to the interface between call center operations and sales and marketing. We identify a handful of broad themes for future investigation while also pointing out several very specific research opportunities.

776 citations

Journal ArticleDOI
TL;DR: This paper presents a review of the literature on personnel scheduling problems and discusses the classification methods in former review papers, and evaluates the literature in the many fields that are related to either the problem setting or the technical features.

706 citations

Journal ArticleDOI
TL;DR: In this paper, the authors extract the essence of SCM and advanced planning in the form of two conceptual frameworks: the house of supply chain management and the supply chain planning matrix.

697 citations