## Search

Now showing items 1-10 of 31

#### Formulations and valid inequalities for the heterogeneous vehicle routing problem

(Springer, 2006)

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin ...

#### A problem space genetic algorithm in multiobjective optimization

(Springer New York LLC, 2003)

In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately ...

#### A problem space algorithm for single machine weighted tardiness problems

(Taylor & Francis Inc., 2003)

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...

#### Simulation metamodelling with neural networks: an experimental investigation

(2002)

Artificial neural networks are often proposed as an alternative approach for formalizing various quantitative and qualitative aspects of complex systems. This paper examines the robustness of using neural networks as a ...

#### The robust spanning tree problem with interval data

(Elsevier, 2001)

Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...

#### A new lower bounding scheme for the total weighted tardiness problem

(1998)

We propose a new dominance rule that provides a sufficient condition for local optimality for the 1∥Σw1Ti problem. We prove that if any sequence violates the proposed dominance rule, then switching the violating jobs either ...

#### A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems

(Taylor & Francis, 1998)

This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and ...

#### Joint lot sizing and tool management in a CNC environment

(Elsevier, 1999)

We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool ...

#### A hierarchical model for the cell loading problem of cellular manufacturing systems

(Taylor & Francis, 1998)

A hierarchical cell loading approach is proposed to solve the production planning problem in cellular manufacturing systems. Our aim is to minimize the variable cost of production subject to production and inventory balance ...

#### Inventory control under substitutable demand: A stochastic game application

(John Wiley & Sons, 2002)

Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product ...