We consider the ordinary NP- hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. We present an O(n2) algorithm for the problem when the machines are ordered, that is, when each job has its smaller...

In this paper we look at two interesting extensions to the classical 2-Facility Weber Problem in ℝ d : At first problems are investigated where we do not allow the optimal locations to be in a specific region. Efficient algorithms for this Global Optimization problem are presented as well as...

In this paper we look at two interesting extensions to the classical 2-Facility Weber Problem in ℝ<Superscript> d </Superscript>: At first problems are investigated where we do not allow the optimal locations to be in a specific region. Efficient algorithms for this Global Optimization problem are presented as well as...</superscript>