This paper treats the problem of setting the inventory level of closed-loop owlines operating under the constant-work-in-process (CONWIP) protocol. We solve ahuge but simple linear program that models an entire simulation run of a closed-loopow line in discrete time to determine a production...

We present a stochastic version of the single-level, multi-product dynamic lotsizingproblem subject to a capacity constraint. A production schedule has tobe determined for random demand so that expected costs are minimized and aconstraint based on a new backlog-oriented Sigma-service-level...

We present a detailed analysis of the patient and resource scheduling problemin rehabilitation hospitals. In practice, the predominantly therapeutical treatmentsand activities which are prescribed for the patients are typically scheduled manually.This leads to rigid and inefficient schedules...

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

This paper treats the problem of setting the inventory level of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a huge but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a...

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

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