functionalities included in each sprint, which makes the planning problem difficult. In this paper we formalize the planning problem and propose an optimization model that, given the estimates made by the project team and a set of development constraints, produces an optimal sprint plan that maximizes the business value perceived by users. The planning problem is converted into a multi-knapsack problem with constraints, given a linear programming formulation, and solved using the IBM ILOG CPLEX Optimizer
Words: 5445 - Pages: 22
Automation is the use of control systems and information technologies to reduce the need for human work in the production of goods and services. In the scope of industrialization, automation is a step beyond mechanization. Whereas mechanization provided human operators with machinery to assist them with the muscular requirements of work, automation greatly decreases the need for human sensory and mental requirements as well. Automation plays an increasingly important role in the world economy and
Words: 7787 - Pages: 32
Refuelling Schedule for Airports By Kiran R K Jitha Babu Shyam S Sreeraj S CHAPTER 1 INTRODUCTION 1.1 REFUELLING Refuelling is an important aspect with respect to the airports since it determines the ground time of an aero
Words: 9437 - Pages: 38
Received in revised form 12 March 2012 Accepted 12 March 2012 Keywords: Carbon footprint Reverse logistics Greenhouse emissions Case study a b s t r a c t Due to the environmental legislation and regulations, manufacturing firms have realized the importance of adopting environmental friendly supply chain management (SCM) practices. In this paper, a mixed integer linear model is developed for a carbon footprint based reverse logistics network design. The proposed model aims at minimizing climate
Words: 4160 - Pages: 17
2. Interprocess Communication, Distributed Objects and Remote Invocation: Introduction , External data representation and marshalling, Communication models, Communication between distributed objects , Remote procedure call Case study: Interprocess communication in UNIX, Java RMI . (4.1-4.6, 5.1-5.5 of Text1) ..6hrs 3. Operating System Introduction , Operating system layer, Processes and
Words: 5050 - Pages: 21
Hazarika INDIAN INSTITUTE OF MANAGEMENT, KOZHIKODE COMPUTATIONAL COMPLEXITY Computational Complexity is a measure of the computational time taken by a particular algorithm. In a scenario where there are multiple algorithms available for a particular problem, the effectiveness of any particular algorithm is gauged on the basis of the time constraint. This is done by breaking the algorithm into its basic steps and then taking a count of each of them. Hence greater is the number of steps, greater is the
Words: 3078 - Pages: 13
present in this paper a new, complete method for distributed constraint optimization, based on dynamic programming. It is a utility propagation method, inspired by the sum-product algorithm, which is correct only for tree-shaped constraint networks. In this paper, we show how to extend that algorithm to arbitrary topologies using a pseudotree arrangement of the problem graph. Our algorithm requires a linear number of messages, whose maximal size depends on the induced width along the particular pseudotree
Words: 5452 - Pages: 22
030 Faculty: Dr. Kais Zaman North South University Table of Contents Objectives 3 Brief Company Profile 4 Methodologies 5 Need for the forecasting 5 Forecasting Methods 8 Qualitative Analysis 10 Linear Programming 13 Conclusion 17 Objectives The primary objective is to find the demand and supply management techniques and the tools that the company uses to predict the demand for their products. The project will also
Words: 3185 - Pages: 13
Natural Computing Series Series Editors: G. Rozenberg Th. Bäck A.E. Eiben J.N. Kok H.P. Spaink Leiden Center for Natural Computing Advisory Board: S. Amari G. Brassard K.A. De Jong C.C.A.M. Gielen T. Head L. Kari L. Landweber T. Martinetz Z. Michalewicz M.C. Mozer E. Oja G. P˘ un J. Reif H. Rubin A. Salomaa M. Schoenauer H.-P. Schwefel C. Torras a D. Whitley E. Winfree J.M. Zurada For further volumes: www.springer.com/series/4190 Franz Rothlauf Design of Modern Heuristics Principles
Words: 114592 - Pages: 459
Abbreviated version of this report is published as "Trends in Computer Science Research" Apirak Hoonlor, Boleslaw K. Szymanski and M. Zaki, Communications of the ACM, 56(10), Oct. 2013, pp.74-83 An Evolution of Computer Science Research∗ Apirak Hoonlor, Boleslaw K. Szymanski, Mohammed J. Zaki, and James Thompson Abstract Over the past two decades, Computer Science (CS) has continued to grow as a research field. There are several studies that examine trends and emerging topics in CS research
Words: 15250 - Pages: 61
