Browsing by Keywords "Mathematical programming"
Now showing items 117 of 17

Automated robotic assembly line design with unavailability periods and tool changes
(Inderscience Publishers, 2016)We focus on an assembly line design problem of a fully automated robotic spotwelding line. Different from existing studies, we take the prescheduled unavailability periods, such as lunch and tea breaks, into account ... 
Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
(INFORMS, 2000)Postoptimality or sensitivity analysis are welldeveloped subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of ... 
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. 
A comparative study of computational procedures for the resource constrained project scheduling problem
(Elsevier, 1994)Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ... 
Coordinated movement of multiple mobile sinks in a wireless sensor network for improved lifetime
(SpringerOpen, 2015)Sink mobility is one of the most effective solutions for improving lifetime and has been widely investigated for the last decade. Algorithms for singlesink mobility are not directly applied to the multiplesink case due ... 
Data dependent worst case bound improving techniques in zeroone 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 ... 
A datalevel parallel linearquadratic penalty algorithm for multicommodity network flows
(Association for Computing Machinery, 1994)We describe the development of a datalevel, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linearquadratic penalty (LQP) algorithm we transform the multicommodity ... 
A goal programming approach to mixedmodel assembly line balancing problem
(Elsevier, 1997)In this paper, a binary goal programming model for the mixedmodel assembly line balancing (ALB) problem is developed. The model is based on the concepts developed by Patterson and Albracht [1] and the model of Deckro and ... 
Incorporating justintime into a decision support system environment
(Elsevier BV, 1991)In this paper, a Decision Support System is proposed for a JustInTime production system. The Decision Support System includes three components: database, model base, and interface. The database contains the predefined ... 
An integrated process planning approach for CNC machine tools
(SpringerVerlag, 1996)In view of the high investment and tooling cost of a CNC machining centre, the cutting and idle times should be optimised by considering the tool consumption and the nonmachining time cost components. In this paper, we ... 
Keyframe reduction techniques for motion capture data
(IEEE, 200805)Two methods for keyframe reduction of motion capture data are presented. Keyframe reduction of motion capture data enables animators to easily edit motion data with smaller number of keyframes. One of the approaches achieves ... 
Modeling of bus transit driver availability for effective emergency evacuation in disaster relief
(2013)Potential evacuees without access to personal automobiles are expected to use transit, especially buses, to reach safer regions. For a transit agency, operation problems to be considered include establishing bus launch ... 
A multi product loading problem: a model and a solution method
(Elsevier, 1997)An important operational problem arises during the transportation and delivery of several products, which cannot be mixed, in the same vehicle at regular intervals. The vehicle has compartments to keep the products ... 
New heuristic for the dynamic layout problem
(Palgrave Macmillan, 2003)The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ... 
Permuting sparse rectangular matrices into blockdiagonal form
(SIAM, 2004)We investigate the problem of permuting a sparse rectangular matrix into blockdiagonal form. Blockdiagonal form of a matrix grants an inherent parallelism for solving the deriving problem, as recently investigated in the ... 
Spatial analysis of single allocation hub location problems
(Springer, 2016)Hubs are special facilities that serve as switching, transshipment and sorting nodes in manytomany distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between ... 
Towards finding global representations of the efficient set in multiple objective mathematical programming
(John Wiley & Sons, 1997)We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global ...