996 resultados para Cost Mining
Resumo:
We analyze a finite horizon, single product, periodic review model in which pricing and production/inventory decisions are made simultaneously. Demands in different periods are random variables that are independent of each other and their distributions depend on the product price. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. Ordering cost includes both a fixed cost and a variable cost proportional to the amount ordered. The objective is to find an inventory policy and a pricing strategy maximizing expected profit over the finite horizon. We show that when the demand model is additive, the profit-to-go functions are k-concave and hence an (s,S,p) policy is optimal. In such a policy, the period inventory is managed based on the classical (s,S) policy and price is determined based on the inventory position at the beginning of each period. For more general demand functions, i.e., multiplicative plus additive functions, we demonstrate that the profit-to-go function is not necessarily k-concave and an (s,S,p) policy is not necessarily optimal. We introduce a new concept, the symmetric k-concave functions and apply it to provide a characterization of the optimal policy.
Resumo:
We analyze an infinite horizon, single product, periodic review model in which pricing and production/inventory decisions are made simultaneously. Demands in different periods are identically distributed random variables that are independent of each other and their distributions depend on the product price. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. Ordering cost includes both a fixed cost and a variable cost proportional to the amount ordered. The objective is to maximize expected discounted, or expected average profit over the infinite planning horizon. We show that a stationary (s,S,p) policy is optimal for both the discounted and average profit models with general demand functions. In such a policy, the period inventory is managed based on the classical (s,S) policy and price is determined based on the inventory position at the beginning of each period.
Resumo:
by John M. Barentine.
Resumo:
El projecte es planteja el repte de cobrir un forat en l’oferta turística seguint la fórmula low cost: el guiatge turístic. La idea de la empresa que volem estudiar i crear (BREAKGUIDES) és la de poder oferir els serveis de guiatge, ja siguin guies correu o guies locals en destinació, seguint una fórmula low cost que s’adapti al nou perfil de turista i al seu pressupost. L’empresa tindrà un perfil semblant al d’una xarxa social que ofereixi serveis de guiatge a canvi d’un petit sou i la manutenció
Resumo:
This paper presents a new charging scheme for cost distribution along a point-to-multipoint connection when destination nodes are responsible for the cost. The scheme focus on QoS considerations and a complete range of choices is presented. These choices go from a safe scheme for the network operator to a fair scheme to the customer. The in-between cases are also covered. Specific and general problems, like the incidence of users disconnecting dynamically is also discussed. The aim of this scheme is to encourage the users to disperse the resource demand instead of having a large number of direct connections to the source of the data, which would result in a higher than necessary bandwidth use from the source. This would benefit the overall performance of the network. The implementation of this task must balance between the necessity to offer a competitive service and the risk of not recovering such service cost for the network operator. Throughout this paper reference to multicast charging is made without making any reference to any specific category of service. The proposed scheme is also evaluated with the criteria set proposed in the European ATM charging project CANCAN
Resumo:
Wavelength division multiplexing (WDM) networks have been adopted as a near-future solution for the broadband Internet. In previous work we proposed a new architecture, named enhanced grooming (G+), that extends the capabilities of traditional optical routes (lightpaths). In this paper, we compare the operational expenditures incurred by routing a set of demands using lightpaths with that of lighttours. The comparison is done by solving an integer linear programming (ILP) problem based on a path formulation. Results show that, under the assumption of single-hop routing, almost 15% of the operational cost can be reduced with our architecture. In multi-hop routing the operation cost is reduced in 7.1% and at the same time the ratio of operational cost to number of optical-electro-optical conversions is reduced for our architecture. This means that ISPs could provide the same satisfaction in terms of delay to the end-user with a lower investment in the network architecture
Resumo:
All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more
Resumo:
This class introduces basics of web mining and information retrieval including, for example, an introduction to the Vector Space Model and Text Mining. Guest Lecturer: Dr. Michael Granitzer Optional: Modeling the Internet and the Web: Probabilistic Methods and Algorithms, Pierre Baldi, Paolo Frasconi, Padhraic Smyth, Wiley, 2003 (Chapter 4, Text Analysis)
Resumo:
Relates to the following software for analysing Blackboard stats http://www.edshare.soton.ac.uk/11134/ Is supporting material for the following podcast: http://youtu.be/yHxCzjiYBoU
Resumo:
peaker(s): Jon Hare Organiser: Time: 25/06/2014 11:00-11:50 Location: B32/3077 Abstract The aggregation of items from social media streams, such as Flickr photos and Twitter tweets, into meaningful groups can help users contextualise and effectively consume the torrents of information on the social web. This task is challenging due to the scale of the streams and the inherently multimodal nature of the information being contextualised. In this talk I'll describe some of our recent work on trend and event detection in multimedia data streams. We focus on scalable streaming algorithms that can be applied to multimedia data streams from the web and the social web. The talk will cover two particular aspects of our work: mining Twitter for trending images by detecting near duplicates; and detecting social events in multimedia data with streaming clustering algorithms. I'll will describe in detail our techniques, and explore open questions and areas of potential future work, in both these tasks.
Networks and RegionalCompetitiveness: Towards a Transaction Cost Approach of Small-Scale Cooperation
Resumo:
A preoccupation with competition often dominates the study of governance. A focus on competition often unnecessarily precludes the possibility that regional institutions can suspend competition in certain areas and facilitate cooperation among potential rivals, thereby potentially contributing to their mutual success. In many ways companies cooperating through these types of networks have a greater degree of flexibility than firms which are forced to rely solely on hierarchies or markets for solutions to their problems. In order to fully understand how such networks work, this article first parses out differences in definitions of networks in order to understand how the type of network mentioned above actually differs from other uses of this term. Then it develops a theory of governance that goes beyond hierarchies and markets by demonstrating how this type of network can lead to reductions in transaction costs. This claim is illustrated on hand from examples of alternative forms of organization in Germany and Italy.
Resumo:
La operación de mega minería que abarca CERREJON se desarrolla bajo lo más altos estándares de seguridad y calidad, con el compromiso de entregar al mercado un excelente producto y evitando el deterioro del entorno. Uno de los puntos más fuertes de la compañía se haya en la integración de los procesos productivos entre la mina de carbón, el ferrocarril y el puerto, logrando que la operación sea eficiente y que garantice niveles altos de óptimos resultados y que los porcentajes de falla no existan o cada vez sean menores en el proceso de explotación y transporte del carbón de Colombia hacia el mundo. El departamento de MATERIALES es el punto de origen para garantizar que se desarrolle la operación, dado que el departamento tiene la gran labor de adquirir y entregar los bienes y servicios requeridos por la Compañía al más bajo costo total evaluado, en el menor tiempo posible y bajo el marco de la legislación Colombiana en el proceso de nacionalización, con un alto énfasis en el desarrollo de relaciones fuertes y sinérgicas entre todos los eslabones de la cadena. Todo el proceso del departamento se enmarca dentro de un ciclo que debe encaminarse a ser cada vez más efectivo y eficiente; de allí que se busquen opciones de mejoramiento para afinar los procesos. Para que sea posible y factible manejar una mega operación como esta se requiere afinar al máximo la red que se establece en su cadena de abastecimiento, buscando lograr un flujo de producto, información y fondos que garanticen disponibilidad del producto, para así generar una rentabilidad alta a la compañía, y controlar los costos por la operación. Dado que la cadena de suministro es susceptible a mejoras, gracias a la interacción con los proveedores, colaboradores y clientes; se pretende sacar el mejor provecho de esto, a través del análisis de la cadena actual de CERREJON; presentando una opción de mejora en uno de los eslabones del proceso productivo, esta opción ha sido contemplada desde años anteriores, pero en esta ocasión gracias a la integración de afinamientos en los sistemas de información, y la participación activa de los proveedores, se encuentra una opción viable de la eliminación de un reproceso, que garantiza eficiencia y efectividad en la agilización del ciclo de producción en CERREJON. A través de la ejecución del proyecto de reforma del conteo, se presenta la oportunidad de mejoramiento en la cadena del departamento; el proceso de reconteo en la mina, realizado posteriormente al conteo inicial en Puerto Bolívar, de los materiales que llegan importados vía marítima. El proceso de afinamiento del recibo documental en el consolidador de carga y los mayores proveedores de entrega directa (HITACHI y MCA) al transportador, genera la opción del uso de terminales portátiles, que de la mano con los ajustes documentales, permitirán que la carga sea contada y separada por localización, para enviarla vía tren a LMN, reduciendo tiempo de entrega al cliente final, los costos de remanejo al volver a contar, y los costos asociados a las entregas no oportunas de devolución de contenedores.