The uncapacitated facility location problem is one of choosing sites among a set of
candidates in which facilities can be located, so that the demands of a given set of clients …

In this paper, we propose an iterated tabu search (ITS) algorithm for the well-known
combinatorial optimization problem, the traveling salesman problem (TSP). ITS is based on …

In this paper we consider the no-wait job shop problem with a makespan objective. This
problem has usually been addressed by its decomposition into a sequencing and a …

In this paper, no-wait job shop problems with makespan minimization are considered. It is
well known that these problems are strongly NP-hard. The problem is decomposed into the …

The no-wait job shop problem that exists with makespan minimization is well known to be a
strongly NP-hard problem. In this paper, the properties of the problem are analyzed …

The goal of this paper is to discuss the tabu search (TS) meta-heuristic and its enhancement
for combinatorial optimization problems. Firstly, the issues related to the principles and …

This paper develops an integrated model between a production capacity planning and an
operational scheduling decision making process in which a no-wait job shop (NWJS) …

Due to increased student numbers and regulation changes educational institutions that
allow for greater flexibility, operations researchers and computer scientists have renewed …

In this paper, the strongly NP-hard no-wait job shop problem with makespan minimization is
considered. By alternatively adopting the “as early as possible” strategy or the “as late as …

A two-stage order scheduling problem with an additional no-wait condition is studied in this
article. All orders must be processed from start to completion without any waiting between …