The dynamics of a mathematical model of a layer of single phytoplankton species growing over a pool of nutrients, proposed by [A.H. Taylor, J.R.W. Harris, J. Aiken, The interaction of physical and biological process in a model of the vertical distribution of phytoplankton under stratification,...

The Minimum Cost Network Flow Problem (MCNFP) includes a wide range of combinatorial optimization problems. Many applications exist for MCNFPs for instance supply chains, logistics, production planning, communications and transportations. Concave costs are, in many applications, more realistic...

In multiobjective linear programming, the weighted-sum functions can be used to characterize the entire set of efficient solutions, but in multiobjective combinatorial-{0,1} problems these functions can only determine a small subset of efficient solutions, called supported efficient solutions....

After a characterization of the cost-oriented assembly line balancing problem it will be shown that by loading the stations maximally the cost-oriented optimum can be missed. Instead of loading the stations maximally the criterion two-stations-rule a has to be used. For generating optimal...

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.