In stochastic lot sizing subject to dynamic and random demand, the minimization of operational costs is not the only conceivable objective. Minimizing the tardiness in customer demand satisfaction is no less important. Furthermore, the decision maker is interested in production plan stability....

Long-term throughput, as a key performance indicator of a stochastic flow line, is affected by numerous parameters describing the features of the flow line, such as processing time and buffer size. Fast and accurate evaluation methods for a given set of values for those parameters are a...

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...

We study the problem of determining both the structure and the schedule of projects subject to capacity constraints. We assume that those projects are flexible in the sense that the activities to be implemented are not entirely known in advance. In such a setting, decisions must be made with...

The transportation processes for patients, personnel, and material in large and complex maximum-care hospitals with many departments can consume significant resources and thus induce substantial logistics costs. These costs are largely determined by the allocation of the different departments...

This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production...

This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete...

This paper presents a profit-oriented shift scheduling approach for inbound contact centers. The focus is on systems in which multiple agent classes with different qualifications serve multiple customer classes with different needs. We assume that customers are impatient, abandon if they have to...

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...

In projects with a flexible project structure, the activities that have to be scheduled are not completely known beforehand. Instead, scheduling such a project includes the decision whether to carry out particular activities at all. This also effects precedence constraints between the finally...