Now showing items 11-16 of 16
A parametric simplex algorithm for linear vector optimization problems
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ...
Joint lot sizing and tool management in a CNC environment
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 ...
New insights on the single machine total tardiness problem
(Palgrave Macmillan, 1997)
Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)
Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
Integrated scheduling and tool management in flexible manufacturing systems
(Taylor & Francis, 2001)
A multistage algorithm is proposed that will solve the scheduling problem in a flexible manufacturing system by considering the interrelated subproblems of processing time control, tool allocation and machining conditions ...
Tree network 1-median location with interval data: a parameter space-based approach
(Taylor & Francis, 2005)
We consider a family of 1-median location problems on a tree network where the vertex weights are ranges rather than point values. We define a new framework for making sound decisions under uncertainty which is primarily ...