[PDF] ALIO Back Matter

More documents

Recommendations

Info

SC05 4 - Pressure Distribution in a Complex Gas Pipeline System using Levenberg-Marquardt Algorithm Septoratno Siregar, Professor, Institut Teknologi Bandung, Department of Petroleum Engineering, Jl. Ganesha 10, Bandung, 40132, Indonesia, septoratno@yahoo.com, Edy Soewono, Darmadi, Lala S Riza, Chasanah K. Widita, Kuntjoro A. Sidarto, Febi Haryadi Natural gas pipeline network was made up of several points of supply and delivery connected by pipeline, allowing steady-state flow of natural gas. The system model, constructed by flow equations in pipeline, consists of a set of nonlinear equations in pressure obtained by writing the continuity equation at each node in the system. In this paper, the problem will be formulated as a nonlinear least square problem which then is solved using Levenberg-Marquardt algorithm. ■ SC05 Velez Sarfield- Second Floor Revenue Management under Choice Behavior Cluster: Revenue Management and Pricing Invited Session Chair: Gustavo Vulcano, New York University, 44 West Fourth Street, Suite 8-76, New York, NY, 10012, United States of America, gvulcano@stern.nyu.edu 1 - Dynamic Pricing and Price Communications Strategies under Sticker Shock Effects Garrett van Ryzin, Paul M. Montrone Professor of Business, Columbia University, 3022 Broadway, 412 Uris Hall, New York, NY, 10027, United States of America, gjv1@columbia.edu, Wei Ke Popescu and Wu (2006) analyzed a dynamic pricing problem of a monopolist firm facing product demand that is sensitive to a consumer’s memory and the firm’s pricing history. We consider an extension on their paper that separates the effect of price communications from price changes. This relaxes the implicit assumption that consumers are instantly informed of the retail price changes and provides interesting insights about when prices changes should and should not be communicated broadly. 2 - CDLP-based Bid Prices for Network Revenue Management Juan Chaneton, UBA, Pabellon 1, Ciiudad Universitaria, Buenos Aires, Argentina, jchaneton@dc.uba.ar, Isabel Méndez-Díaz, Gustavo Vulcano, Paula Zabala The primal solution of the linear programming formulation for choice-based revenue management (CDLP) is known to be effective from a revenue perspective. However, from a practical perspective, there is a representation issue since airline systems are in principle incompatible with those offer sets. In this work, we consider a variation of the CDLP that naturally generates bid-prices. From our exhaustive numerical experiments, their performance is promising. 3 - A Branch-and-cut Algorithm for the Latent-class Logit Assortment Problem Isabel Méndez-Díaz, FCEyN-Universidad de Buenos Aires, Pabellón 1, Ciudad Universitaria, Buenos Aires, Argentina, imendez@dc.uba.ar, Juan José Miranda-Bront, Gustavo Vulcano, Paula Zabala We study the product assortment problem of a retail operation. Each customer checks the offer set displayed by the firm, and either chooses one of those products or quits without purchasing. The firm’s goal is to maximize the expected revenue extracted from each customer. The general version of the problem is NP-Hard. In this paper, we analyze unconstrained and constrained versions of it, and propose a B&C algorithm that is computationally feasible and leads to high-quality solutions. ■ SC06 Aula 352- Third Floor Cost/Performance Analysis Contributed Session Chair: Santiago Najera, Gerente de Productividad y Eficiencia, Pronaca, Los Naranjos N44-15 y Av.de los Granados, Quito, Pi, Ecuador, santiagonajera@hotmail.com 1 - Calculation of the Constant of Olson using MatLab Henry Márquez, Professor, Universidad de Oriente, Avda. Universidad. Dpto. Matemáticas, Cumaná, 6101, Venezuela, henrylmarquez@gmail.com, Felicia Villarroel One will settle down a method and its implementation using the computational package MatLab for the calculation of the exact values of the constant of Olson for a abelian group of order n, greater or equal to 2. <strong>ALIO</strong> / INFORMS International – 2010 36 2 - The Financial Aspect of the Managing of the Processes in Maintenance Slavica Jovetic, Professor/Doctor, Faculty of Economics, Dj. Pucara Starog 3, Sv. Markovica 11/A/5, Kragujevac, 34000, Serbia-Montenegro, sjovetic@kg.ac.yu TQM idea is: each process and characteristic has its nominal value. Deviation of the process from its nominal value is considered as loss/ non-quality cost. In this paper TQM idea is applied and developed for maintenance of the process in an organization, which has defined its processes and manages them. The paper is a result of authors’ work on projects of implementing statistical, engineering and managerial methods of process control as well as on the project of reducing all costs. 3 - Technical Efficiency and Marketing Productivity: Case of a Life Insurance Company Hanns de la Fuente, Universidad de Talca, Camino a Los Niches Km.1, Curicó, Chile, hdelafuente@utalca.cl, Marta Pedraja, José Luis Rojas, Carmen Berné This paper analyzes the case of a life insurance company, where levels of technical efficiency and the factors that determine the marketing productivity are unknown. It applies Stochastic Frontier approach along with Econometric Models. The results of this study show increasing levels of efficiency in time, and a marketing productivity determined by several factors depending on the unit under study. 4 - Managing and Measuring Information System Project Critical Success Factors Otilija Sedlak, Associate Professor, Faculty of Economics, Segedinski put 9-11, Subotica, 24000, Serbia-Montenegro, zotisz@tippnet.rs, Zoran Ciric Project performance has become a significant issue, especially as poor performance in high profile information systems projects. The project critical success factors: cost, quality, time, customer expectations. In this paper will be evaluated an integrative framework of performance for managing and measuring projects to bring together numerous and evolving strands. 5 - Optimizing the Swine Industry Through the Optimization of the Production Pyramid at the Breeding Farms, using Markov’s Chains Santiago Najera, Gerente de Productividad y Eficiencia, Pronaca, Los Naranjos N44-15 y Av.de los Granados, Quito, Pi, Ecuador, santiagonajera@hotmail.com, Jorge Duque The present work deals with the aspects of helping optimize the swine industry, all aimed at finding a better performance for the company and a better service to the customers. Through the optimization of the management at the breeding farms. ■ SC07 Aula 353- Third Floor Planning and Scheduling of Industrial Processes I Cluster: Special Invited Sessions Invited Session Chair: Gabriela Henning, Professor, Universidad Nacional del Litoral- CONICET, Güemes 3450, Santa Fe, SF, S3000GLN, Argentina, ghenning@intec.unl.edu.ar Co-Chair: Aldo Vecchietti, Professor, INGAR, Avellaneda 3657, Santa Fe, 3000, Argentina, aldovec@santafe-conicet.gov.ar 1 - Automated Restoration of Disrupted Schedules Armando Guarnaschelli, INGAR, Avellaneda 3657, Santa Fe, Argentina, guarnaschelli@santafe-conicet.gov.ar, Omar Chiotti, Enrique Salomone Execution of supply processes is challenged by the occurrence of disruptive events forcing a rescheduling of tasks to reestablish feasibility of operation. We present a generic MILP based model which is capable of systematically restoring feasibility of execution by doing minimum impact modifications to the current schedule, within the slacks in the resources already provided in the plan. This level of rescheduling is suitable for gearing an automated execution control system. 2 - A Hybrid Knowledge-based/Constraint Programming Framework for the Reactive Scheduling of Batch Plants Juan Matías Novas, Doctoral Fellow, INTEC, Guemes 3450, Santa Fe, SF, 3000, Argentina, mnovas@intec.unl.edu.ar, Gabriela Henning A support framework to address the repair-based reactive scheduling problem is proposed. It is based on an explicit domain knowledge representation and a constraint programming approach. When an unforeseen event occurs, the framework captures the in-progress agenda status, as well as the event effect on it. Provided that good quality solutions can be reached in low CPU times, alternative solution scenarios focusing on stability and regular performance measures can be posed for each problem.
3 - A General MILP Framework for Batch Process Scheduling: Modeling and Computational Issues Diego Marcelo Giménez, Doctoral Fellow, INTEC, Güemes 3450, Santa Fe, SF, S3000GLN, Argentina, dmgimenez@gmail.com, Gabriela Henning, Christos Maravelias A highly expressive representation for the short-term scheduling of batch processes was recently presented by the authors of this paper. This proposal allows addressing a wide variety of problems by overcoming several limitations of existing approaches. Nevertheless, the expressiveness of the representation is gained at the expense of its computational performance. This contribution presents an enhanced MILP formulation that leads to significant CPU time reductions in reaching optimal solutions. ■ SC08 Aula 355- Third Floor Dynamic Programming Applications Sponsor: Decision Analysis Sponsored Session Chair: Canan Ulu, University of Texas, IROM, B6500, 1 University Station, Austin, TX, 78712, United States of America, canan.ulu@mccombs.utexas.edu 1 - Information Gathering Through Different Channels in Newsvendor Problems Canan Ulu, University of Texas, IROM, B6500, 1 University Station, Austin, TX, 78712, United States of America, canan.ulu@mccombs.utexas.edu, James Smith We study information gathering policies in a multi-period newsvendor problem if the demand distribution is unknown. Previous models study information gathering through observed demand or sales; we assume that in addition to choosing an order quantity, the newsvendor has the option to gather additional information about demand prior to placing his order. We discuss structural properties of the optimal profits and order quantities. 2 - Learning in Spatial Product Differentiation Models Dorothee Honhon, Assistant Professor, McCombs School of Business, University of Texas at Austin, Austin, TX, United States of America, dorothee.honhon@mccombs.utexas.edu, Canan Ulu, Aydin Alptekinoglu A firm decides the assortment of products to offer in a given category, over a 2period horizon. Customer preferences are represented by a one-dimensional spatial differentiation model but the firm does not know the exact distribution of customer preferences. Given a prior distribution, the firm decides how many products to offer and where to locate them. After observing the (possibly censored) sales in period 1, the firm updates the prior and determines the assortment in period 2. 3 - Allocation of Resources among R&D and Marketing Activities Dinah Vernik, Assistant Professor of Marketing, Rice University, 6100 Main Street, Houston, TX, United States of America, Dinah.Vernik@rice.edu, Canan Ulu An innovative firm needs consider R&D related decisions such as improving product quality or production technologies in addition to marketing related decisions such as exploring consumer tastes and investing in advertising or sales. We study interactions among such decisions using a dynamic programming model. ■ SC09 Aula 356- Third Floor Queuing Systems Contributed Session Chair: Hui-Chih Hung, Assistant Professor, National University of Singapore, Dept of ISE, Block E1A, #06-25, 1 Engineering Drive 2, Singapore, 117576, Singapore, isehh@nus.edu.sg 1 - Role of Higher Moments of Arrival and Servicer in G/G/m Approximations Daniel Felipe Otero, Universidad de los Andes, Cra 1 Este # 19A-40, Bogotá, Colombia, raha.akhavan.tabatabaei@gmail.com, Raha Akhavan-Tabatabaei Classical G/G/m approximations consider up to the second moment of inter-arrival times and service times. We study the role of the third and fourth moments in the accuracy of cycle time estimation by these models. We present some cases in semiconductor manufacturing where considering the higher moments can improve the estimates. <strong>ALIO</strong> / INFORMS International – 2010 SC10 37 2 - Sensitivity Performance of a Production Process by Varying the Queue Space at the Workstations Walter Silva, Pontificia Universidad Católica Del Peru, Av. Universitaria 1801. San Miguel, Lima, Peru, walter.silva@pucp.edu.pe, Wilmer Atoche This paper shows the simulation as a process confined spaces influence the determination of overall efficiency. The limited physical space in production processes make the lot size per workstation is limited also by influencing the overall performance. It simulate the changes in the overall performance spaces of varying tail of products in process at the workstation. 3 - A Markov Chain Model for Cycle Time Estimation of Workstations with Operational Rules Raha Akhavan-Tabatabaei, Universidad de los Andes, Cra 1 Este # 19A-40, Bogotá, Colombia, raha.akhavz@gmail.com, Juan Jose Ucros, Juan Carlos Gutierrez We propose a Markov chain model with dependency between the arrival and service processes to model toolsets in semiconductor manufacturing. Using phaetype distributions we estimate the cycle time of toolset with a range of arrival and service distributions in presence of operational rules. We verify the model with simulation and the results confirm the accuracy of the proposed Markov over common G/G/m approximations. 4 - Allocation of Jobs and Identical Resources to Multiple Pooling Centers Hui-Chih Hung, Assistant Professor, National University of Singapore, Dept of ISE, Block E1A, #06-25, 1 Engineering Drive 2, Singapore, 117576, Singapore, isehh@nus.edu.sg, Jung-Kyung Kim To minimize total WIP cost, we examine stochastic resource allocation problem where identical servers are grouped into pooling centers, and simultaneously job types are assigned to centers. Each job type has distinct WIP weight and each center is an M/M/s system. We explore optimality criteria of 2-center configuration and show multi-center config. is rarely optimal. We examine necessary conditions and find monotonic properties. Bounds for workload ratios are developed and empirically evaluated. ■ SC10 Aula 357- Third Floor Graph Spectra with Applications on Combinatorial Optimization I Cluster: Special Invited Sessions Invited Session Chair: Nair Abreu, Professor, Universidade Federal de Rio de Janeiro, Centro de Tecnologia, Bloco F, Sala 103 - Ilha do Fundao, Rio de Janeiro, 22430-210, Brazil, nairabreunovoa@gmail.com 1 - A Survey on Spectral Graph Theory Techniques in Combinatorial Optimization Domingos Cardoso, Professor, Universidade de Aveiro, Campus Universitário de Santiago, Aveiro, Portugal, dcardoso@ua.pt A number of remarkable spectral properties of graphs with applications in combinatorial optimization are surveyed and a few additional ones are introduced. Namely, several spectral bounds on the clique number, stability number, and chromatic number of graphs are analyzed and spectral graph tools for deciding about the existence of particular combinatorial structures (as it is the case of dominating induced matchings) are presented. 2 - Ordering a Class of Caterpillars by Algebraic Connectivity Vilmar Trevisan, Professor, Universidade Federal do rio Grande do Sul, UFRGS - Instituto de Matemática, Porto Alegre, RS, 90050-310, Brazil, trevisan@mat.ufrgs.br, Israel Rocha For $d\geq3$ and $n>2(d-1)$, let $p=[p_1,p_2,...,p_{d-1}]$ with $p_i\geq1$ and $C(p)$ the caterpillar obtained from the stars $S_{p_i}, the path $P_{d-1}$, identifying the root of $S_{p_i}$ with $i$-th vertex of $P_{d-1}$. In this note we will be interested in the caterpillar $C_k=C(1,1,...,p_k,1,...,1), p_k\geq2$ with diameter $d$ and algebraic connectivity $a(C_k)$ and we show that the algebraic connectivity $a(C_k)$ is an increasing function of $k$ for $k=1,\ldots \lfloor (d-1)/2 \rfloor$. 3 - A Fiedler’s Result Applied to Graph Spectra and Graph Energy Enide Andrade, Professor, Universidade de Aveiro, Campus Universitário de Santiago, Aveiro, 3810-193, Portugal, enide@ua.pt, Maria Robbiano, Domingos Cardoso, Ivan Gutman In this work we present a generalization of a Fiedler’s lemma introduced in [M. Fiedler, Eigenvalues of nonnegative symmetric matrices, Linear Algebra Appl. 9 (1974): 119-142] and this generalization is applied to the determination of eigenvalues of graphs belonging to a particular family and also to the determination of the graph energy (including lower and upper bounds).
Page 1 and 2: How to Navigate the Technical Sessi
Page 3 and 4: ■ SA06 Aula 352- Third Floor Elec
Page 5 and 6: 2 - A Ship Track Anomaly Detection
Page 7 and 8: 3 - A Scatter Search Approach to a
Page 9 and 10: 4 - Discrete Event Simulation for t
Page 11 and 12: 2 - The Minimum Cost Shortest-path
Page 13 and 14: ■ SB16 Aula 385- Third Floor Meta
Page 15: ■ SC02 Aula 360- Third Floor Aid
Page 19 and 20: 2 - Optimization of a Money Supply
Page 21 and 22: 4 - Controller Bus Sergio Daniel Co
Page 23 and 24: 4 - Attributes of Authors and Paper
Page 25 and 26: ■ SD11 Aula 362- Third Floor Algo
Page 27 and 28: 3 - The Traveling Salesman Car Rent
Page 29 and 30: Monday, 8:30am - 10:00am ■ MA01 A
Page 31 and 32: 3 - Quadratic Algorithm for Minimiz
Page 33 and 34: ■ MA15 Aula 351- Third Floor Stoc
Page 35 and 36: the subproblem has no defined dual
Page 37 and 38: 2 - Reference Point Formation and U
Page 39 and 40: ■ MB15 Aula 351- Third Floor Less
Page 41 and 42: 3 - Cutting Stock with Part Type Sc
Page 43 and 44: 2 - Bicriteria Optimization in the
Page 45 and 46: at time T, they sell it in a retail
Page 47 and 48: 3 - Railway Scheduling Based on Pas
Page 49 and 50: 3 - Global Optimization of Water Ma
Page 51 and 52: 4 - Simulation of Dynamics on the U
Page 53 and 54: 3 - Improving Execution Time and Ac
Page 55 and 56: Tuesday, 8:30am - 10:00am ■ TA01
Page 57 and 58: 2 - A Greedy Heuristic for Makespan
Page 59 and 60: ■ TA13 Aula 364- Third Floor OR A
Page 61 and 62: ■ TA18 Aula 384- Third Floor Tran
Page 63 and 64: ■ TB04 Salón Azul- First Floor M
Page 65 and 66: ■ TB10 Aula 357- Third Floor Grap
Page 67 and 68:
2 - A Heuristic for the Process Sel
Page 69 and 70:
■ TC03 Auditorio- First Floor Tea
Page 71 and 72:
■ TC09 Aula 356- Third Floor Simu
Page 73 and 74:
3 - Auctions with Resale Market and
Page 75 and 76:
■ TC20 Aula 382- Third Floor Eval
Page 77 and 78:
4 - Effectiveness of Government Pol
Page 79 and 80:
3 - Solution Methods for Non-convex
Page 81 and 82:
4 - Guiding Parallel Heterogeneous
Page 83 and 84:
Wednesday, 8:30am - 10:00am ■ WA0
Page 85 and 86:
.4 - Improvement of the Process of
Page 87 and 88:
2 - An International Supply Chain O
Page 89 and 90:
4 - Application of Metaheuristics:
Page 91 and 92:
2 - An Operations Research Approach
Page 93 and 94:
■ WB08 Aula 355- Third Floor Dyna
Page 95 and 96:
Ratio Method. It is worth pointing
Page 97 and 98:
2 - Housings Localization for Homes
Page 99 and 100:
3 - Game Models for Effective Secur
Page 101 and 102:
■ WC10 Aula 357- Third Floor Grap
Page 103 and 104:
■ WC15 Aula 351- Third Floor Fuzz
Page 105 and 106:
4 - A GRASP Algorithm for Designing
Page 107 and 108:
■ WD09 Aula 356- Third Floor Simu
Page 109 and 110:
methods can reduce the inference ex
Page 111 and 112:
P Palominos, Pedro SB17 Parada, Ví
Page 113 and 114:
Breton, Michéle WB01 Brito, Daniel
Page 115 and 116:
Gay, David M. TB04 Gazzola, Rosaura
Page 117 and 118:
Medaglia, Andrés L. SB20, MA08, MB
Page 119 and 120:
Rubino, Gerardo MC14, TD20, WA20, W
Page 121 and 122:
Sunday, 10:00am - 11:30am SA01 Tuto
Page 123 and 124:
Tuesday, 8:30am - 10:00am TA01 Tuto
show all

[PDF] ALIO Back Matter

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?