We analyze a model of irreversible investment with two sources of uncertainty. A riskneutral decision maker has the choice between two mutually exclusive projects under input pric...
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...