Now showing items 1-8 of 8
Tool allocation and machining conditions optimization for CNC machines
In the literature, there exist many variations of machining economics problem in terms of modelling approaches and solution methodologies. However most of the existing studies focus on the single machining operation which ...
An integrated evaluation of facility location, capacity acquisition, and technology selection for designing global manufacturing strategies
(Elsevier BV, 1992)
Emergence of global markets enhanced the emergence of global firms which have plants in different countries and implement an integrated management style. Due to the intensive competition in global markets, manufacturing ...
Data dependent worst case bound improving techniques in zero-one programming
(Elsevier BV, 1991)
A simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require ...
New characterizations of ℓ1 solutions to overdetermined systems of linear equations
New characterizations of the ℓ1 solutions to overdetermined system of linear equations are given. The first is a polyhedral characterization of the solution set in terms of a special sign vector using a simple property of ...
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 ...
An equipment replacement problem with dynamic production planning and capacity considerations
(Taylor & Francis, 1996)
In this paper, we propose a 0-1 integer programming formulation for an equipment replacement problem in which the demand of a product varies from period to period and different types of equipment with different production ...
Single machine earliness-tardiness scheduling problems using the equal-slack rule
(Palgrave Macmillan Ltd., 1994)
The purpose of this paper is to analyze a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. ...
A characterization of the optimal set of linear programs based on the augmented lagrangian
(Taylor & Francis, 1999)
It is proved that in a certain neighborhood of the optimal set of multipliers, the set of minimizers of the augmented lagrangian nmction generates a new characterization of the optimal solution set of the linear program.