One of the basic assumptions of the classical dynamic lot-sizing model is that theaggregate demand of a given period must be satisfied in that period. Under thisassumption, if backlogging is not allowed then the demand of a given period cannotbe delivered earlier or later than the period. If...

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...

This paper presents a generic modeling framework to simultaneously decide about production quantities and maintenance operations for a capacitated resource facing a dynamic demand for di erent types of products. As the resource needs to be setup for each speci c type of product, a lot-sizing...

The well-known Capacitated Lot-Sizing Problem (CLSP) is based on the assumption that for each lot in a period setup costs are incurred. The setup costs of a CLSP solution can be reduced by linking the production quantities of an item which is scheduled in two adjacent periods. Therefore we...

A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. A...

Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm...

A real-world planning problem of a printing company is presented where different sorts of a consumer goods’ label are printed on a roll of paper with sufficient length. The printer utilizes a printing plate to always print several labels of same size and shape (but possibly different imprint)...

Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm...