Resource-constrained project scheduling under a net present value objective attracts growing interest. Because this is an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have become a popular research field. Up to now, however, tight...

A flow line consists of a sequence of work places (or stations) through which one or more producta (or models) move one-way in order to be processed. Each model requires specific Operations which must be performed in a predefined Order. To be able to do so, the stations must be equipped with...

While balancing straight assembly lines is a well-studied problem, the Situation where the assembly line has a U-shaped Iayout is a still emerging research field. The advantage of these lines is that workers may simply turn around to operate at two legs of the line. Hence, there is an additional...

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...

This contribution deals with dynamic, capacitated, multi-level lot sizing and scheduling. The basic assumption is that for each item there is exactly one machine that this item can be manufactured on but no two items share a common machine. Finding an optimal solution with a greedy algorithm...

This contribution acquaints the reader with a model for multi-level single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first papers that deals with dynamic capacitated multi-level lot sizing and...

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

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