The Capacitated Facility Location Problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. A variety of lower bounds based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. However, in...

A batch sequencing model with sequence-dependent setup-times and -costs is used to compare modelling and solving with two different general solvers. "Conceptual models" are implemented in the constraint propagation / logic programming language CHARME and solved with the PROLOG inference engine....

Two phases can be distinguished in academic course scheduling: In phase one lectures have to be assigned to professors, whereas in phase two the lectures have to be scheduled. Here we assume that the lectures are already assigned to professors, i.e. the first phase has been done. For the second...

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of...

This paper addresses an airport gate assignment problem with multiple objectives. The objectives are to minimize the number of ungated flights and the total passenger walking distances or connection times as well as to maximize the total gate assignment preferences. The problem examined is an...

Ever since the publication of Pontryagin's Maximum Principle, the number of its applications to management science problems has been steadily growing. This paper is an up-to-date survey of the applications of the deterministic maximum principle to the three functional areas of management:...

A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via...

We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

We study infinite-horizon stochastic inventory problems with general demand distributions and piecewise linear concave ordering costs. Such costs arise in the important cases of quantity discounts or multiple suppliers. We consider the case of concave cost involving two linear segments. This...

This paper is concerned with the problem of production planning in a flexible manufacturing system consisting of a single or parallel failure-prone machines producing a number of different products. The objective is to choose the rates of production of the various products over time in order to...