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

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

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

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

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