Now showing items 375-394 of 677

• #### A modified material model for the finite element simulation of machining titanium alloy Ti-6Al-4V ﻿

(Taylor & Francis, 2010)
Because of their desirable properties, such as high strength to weight ratio and corrosion resistance, titanium alloys are commonly employed in the aerospace and medical device industries. Titanium alloys are known to be ...
• #### The morphological changes upon cryomilling of cellulose and concurrent generation of mechanoradicals ﻿

(Elsevier, 2019)
Microstructural features such as grain size, grain morphology, and phase fractions have significant influence on process outputs of machining processes. During micro end milling where feed per tooth and depth of cut values ...
• #### Move based heuristics for the unidirectional loop network layout problem ﻿

(Elsevier, 1998-07-01)
We consider the loop network layout problem in a manufacturing system where n machines must be placed in n available locations around a loop to minimize the total flow distance. The formulation of the problem results in a ...
• #### A multi-modal discrete-event simulation model for military deployment ﻿

(Elsevier, 2009)
This paper introduces a logistics and transportation simulation that can be used to provide insights into potential outcomes of proposed military deployment plans. More specifically, we model a large-scale real-world ...
• #### Multi-period supplier selection under price uncertainty ﻿

(Palgrave Macmillan, 2014)
We consider a problem faced by a procurement manager who needs to purchase a large volume of multiple items over multiple periods from multiple suppliers that provide base prices and discounts. Discounts are contingent on ...
• #### Multi-population parallel genetic algorithm using a new genetic representation for the euclidean traveling salesman problem ﻿

(İstanbul Technical University, 2005)
This paper introduces a multi-population genetic algorithm (M-PPGA) using a new genetic representation, the kth-nearest neighbor representation, for Euclidean Traveling Salesman Problems. The proposed M-PPGA runs M greedy ...
• #### Multi-stage airline scheduling problem with stochastic passenger demand and non-cruise times ﻿

(Elsevier, 2018)
We propose a three-stage stochastic programming model which determines flight timing, fleeting and routing decisions while considering the randomness of demand and non-cruise times. Our model differs from the existing ...
• #### A multi-stage stochastic programming approach in master production scheduling ﻿

(Elsevier, 2011)
Master Production Schedules (MPS) are widely used in industry, especially within Enterprise Resource Planning (ERP) software. The classical approach for generating MPS assumes infinite capacity, fixed processing times, and ...
• #### The multi-terminal maximum-flow network-interdiction problem ﻿

(2011)
This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K ≥ 3 pre-specified node groups while an interdictor ...
• #### Multihoist cyclic scheduling with fixed processing and transfer times ﻿

(Institute of Electrical and Electronics Engineers, 2007-07)
In this paper, we study the no-wait multihoist cyclic scheduling problem, in which the processing times in the tanks and the transfer times between tanks are constant parameters, and develop a polynomial optimal solution ...
• #### Multimodal hub location and hub network design ﻿

(2012)
Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In addition to the location ...
• #### Multiple part-type scheduling in flexible robotic cells ﻿

(Elsevier, 2012-02)
This paper considers the scheduling problem arising in two-machine manufacturing cells which repeatedly produce a set of multiple part-types, and where transportation of the parts between the machines is performed by a ...
• #### Multisource Bayesian sequential binary hypothesis testing problem ﻿

(2012)
We consider the problem of testing two simple hypotheses about unknown local characteristics of several independent Brownian motions and compound Poisson processes. All of the processes may be observed simultaneously as ...
• #### Near optimality guarantees for data-driven newsvendor with temporally dependent demand: A Monte Carlo approach ﻿

(IEEE, 2013)
We consider a newsvendor problem with stationary and temporally dependent demand in the absence of complete information about the demand process. The objective is to compute a probabilistic guarantee such that the expected ...
• #### Near-optimal modified base stock policies for the capacitated inventory problem with stochastic demand and fixed cost ﻿

(World Scientific Publishing, 2014)
In this study, we investigate a single-item, periodic-review inventory problem where the production capacity is limited and unmet demand is backordered. We assume that customer demand in each period is a stationary, discrete ...
• #### Necessary and sufficient conditions for noiseless sparse recovery via convex quadratic splines ﻿

(Society for Industrial and Applied Mathematics Publications, 2019)
The problem of exact recovery of an individual sparse vector using the Basis Pursuit (BP) model is considered. A differentiable Huber loss function (a convex quadratic spline) is used to replace the $\ell_1$-norm in the ...
• #### Network hub location problems: The state of the art ﻿

(Elsevier, 2008)
Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to ...
• #### A neural network model for scheduling problems ﻿

(Elsevier, 1996)
Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...
• #### A new bounding mechanism for the CNC machine scheduling problems with controllable processing times ﻿

(Elsevier, 2005)
In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the ...
• #### New characterizations of ℓ1 solutions to overdetermined systems of linear equations ﻿

(Elsevier, 1994)
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 ...