A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik

Save this PDF as:

Size: px
Start display at page:

Download "A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik"

Transcription

1 Decision Making in Manufacturing and Services Vol No. 1 2 pp A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution Bartosz Sawik Abstract. This paper presents an application of mixed integer programming model for optimal allocation of workers among supporting services in a hospital. The services include logistics, inventory management, financial management, operations management, medical analysis, etc. The optimality criterion of the problem is to minimize operational costs of supporting services subject to some specific constraints. The constraints represent specific conditions for resource allocation in a hospital. The overall problem is formulated as a tripleobjective assignment model, where the decision variables represent the assignment of people to various jobs. A reference point approach with the Chebyshev metric is applied for the problem solution. The results of computational experiments modeled on a real data from a hospital in Lesser Poland are reported. Keywords: reference point method, assignment problem, mixed integer programming, services operations management, healthcare planning. Mathematics Subject Classification: 90B50 management decision making, 90B80 discrete location and assignment, 90C11 mixed integer programming, 90C90 applications of mathematical programming. Revised: 01 December INTRODUCTION The assignment of service positions plays an important role in healthcare institutions. Poorly assigned positions in hospital departments or over-employment may result in increased expenses and/or degraded customer service. If too many workers are assigned, capital costs are likely to exceed the desirable value (Brandeau, 2004). The supporting services have a strong impact on performance of healthcare institutions such as hospitals. In hospital departments, the supporting services include financial management, logistics, inventory management, analytic laboratories, etc. This paper presents an application of operations research model for optimal supporting service Department of Applied Computer Science, Faculty of Management, AGH University of Science and Technology, Kraków, Poland, b 37

2 38 B. Sawik jobs allocation in a public healthcare institution. The optimality criterion of the problem is to minimize operations costs of a supporting service subject to some specific constraints. The constraints representing specific conditions for resource allocation in a hospital were modified, compared to previous publications (Sawik and Mikulik, 2008a; Sawik and Mikulik, 2008b; Sawik, 2008c; Sawik, 2010). The overall problem is formulated as a mixed integer program in the literature known as the assignment problem (Burrkard, 2008; Nemhauser, 1999). The binary decision variables represent the assignment of people to various services. This paper shows practical usefulness of mathematical programming approach to optimization of supporting services in healthcare institutions. The results of some computational experiments modeled after a real data from a selected Polish hospital are reported. 2. DATA USED FOR COMPUTATIONS The real data from a selected Polish public healthcare institution from a one month period were used for computations. The data include 17 supporting service hospital departments, in which there are 74 types of supporting service jobs (Sawik and Mikulik, 2008a; Sawik and Mikulik, 2008b; Sawik, 2008c; Sawik, 2010). Permanent employment is defined as a percent of permanent post between 25% (0.25) to 100% (1.00) according to the size of a job position (part-time or full time) for a selected job in a selected department. It is possible that a department has four half time permanent employees and this could be for example an equivalent to two full time permanent employments. Supporting service departments in the hospital consist in total of permanent employments with 192 workers employed before the optimization. Specific data consists of the average salaries for selected jobs in the departments defined as costs of assignment of workers to jobs. Furthermore, the average amount of money paid monthly for services in each department was used. Additional parameters include the number of permanent employments in each department and the size of permanent employments (i.e. 0.25, 0.50, 0.75, 1.00) for each job defined as partial or full time. In addition, the minimum number of permanent employments for each job in each department was given, and the maximal number of positions which can be assigned to a single worker. Table 1 presents the number of workers and service jobs in the hospital departments and the total number of workers in all departments before the optimization. Table 1. Number of workers and service jobs in the hospital departments before optimization Supporting service departments Number of workers Number of jobs Attorneys-at-law 4 2 Law Regulation 7 3 Technical Executive 4 4 Business Executive 8 5

3 A Reference Point Method to Triple-Objective Table 1. (continued) Information 7 4 Material Monitoring 13 5 Sterilization 27 5 Hospital Pharmacy Economy 21 5 Technical 11 5 Medical Equipment 8 4 Distribution 6 3 Heating and Air-condition 11 4 Ventilation and Air-condition 8 4 Medical Bottled Gases 6 2 Power 15 3 Central Heating 16 5 All departments Table 2 shows the number of types of permanent employments and the maximum amount of money paid for services in the hospital departments before optimization. Table 2. Number of permanent employments and the maximum amount of money paid for services in the hospital departments before optimization Supporting service departments Number of types of permanent employments Amount of money paid for services [PLN] Attorneys-at-law 2.5 7,950 Law Regulation 7 16,100 Technical Executive 4 7,150 Business Executive 5 15,450 Information 4 16,100 Material Monitoring 5 27,150 Sterilization 5 41,500 Hospital Pharmacy 11 43,400 Economy 5 31,360 Technical 5 20,950 Medical Equipment 4 17,500 Distribution 3 13,600 Heating and Air-condition 4 21,200 Ventilation and Air-condition 4 16,650 Medical Bottled Gases 2 11,400 Power 3 31,050 Central Heating 5 29,250 All departments ,760

4 40 B. Sawik 3. REFERENCE POINT METHOD Consider the following multi-objective problem: Maximize z l = f l (x) z q = f q (x) subject to x X, x 0, where X R n denotes the non-convex set of feasible solutions defined by a set of functional constraints linear inequalities. The reference point method is based on the Chebyshev metric (Alves, 2007; Bowman, 1976). Let us denote by f(x) f β the β-weighted Chebyshev metric, i.e. min 1 l q {β l f l (x) f }, where β l 0 l, q l=1 β l = 1, and f denotes a reference point of the criteria space. Considering f(x) >f for all x X, it has been proven (Bowman, 1976) that the parameterization on β of min x X f l (x) f β generates the non-dominated set of solutions. The program min x X f l (x) f β may yield weakly non-dominated solutions, which can be avoided by considering the augmented weighted Chebyshev program: Minimize δ + γ q f l (x) l=1 subject to ( β l fl (x) f ) δ, 1 l q x X δ 0, where γ is a small positive value. It has been proven (Ehrgott, 2000; Steuer, 1986) that there always exists γ small enough that enable to reach all the non-dominated set for the finite-discrete and polyhedral feasible region cases (Alves, 2007). The reference points are defined as ideal values of objective functions. 4. PROBLEM FORMULATION Mathematical programming approach deals with optimization problems of maximizing or minimizing a function of many variables subject to inequality and equality constraints and integrality restrictions on some or all of the variables. In particular, 0-1 variables represent binary choice. Therefore, the model presented in this paper is defined as a mixed integer programming problem. Suppose there are m people and p jobs, where m p. Each job must be done by at least one person; also, each person can do at least, one job. The cost of person i doing job k is c ik. The problem objective is to assign the people to the jobs so as to minimize the total cost of completing all of the jobs. The optimality criterion of the defined problem is to minimize operations costs of a supporting service subject to some specific constraints. The constraints represent specific conditions for resource allocation in a hospital. The overall problem is

5 A Reference Point Method to Triple-Objective formulated as a modified assignment problem. The decision variables represent the assignment of people among various services. Compared to previously published papers (Sawik and Mikulik, 2008a; Sawik and Mikulik, 2008b; Sawik, 2008c; Sawik, 2010) decision variables and constraints were modified. Table 3 shows the notation used in this section. Table 3. Notation Indices i worker, i I = {1,...,m}; j supporting service hospital department, j J = {1,...,n}; k type of supporting service job k K = {1,...,p}; Input parameters c ik cost of an assignment of a worker i to job k (i.e. monthly salary); C j maximal monthly budget for salaries in a department j; e k size of permanent (partial or full time) employment for job k (i.e. e k = 0.25 or 0.50 or 0.75 or 1.00); E j maximal number of permanent employments in a department j; h jk minimal number of permanent employments for job k in a department j; β i weight of the objective function f opt i,i=1, 2, 3; γ small positive value; f opt 1 ideal solution value of number of workers selected for an assignment to any job in any department; f opt 2 ideal solution value of operational costs of the supporting services; f opt 3 ideal solution value of number of permanent employments for all jobs in all departments; Decision variables x ijk 1 if worker i is assigned to job k in department j, 0 otherwise; y i 1 if worker i is assigned to any job in any department, 0 otherwise; g jk number of permanent employments for job k in department j; δ deviation from the reference solutions. 5. OPTIMIZATION MODEL The problem of optimal assignment is formulated as a triple objective integer program, which allows commercially available software (e.g. AMPL/CPLEX (Fourer, 1990)) to be applied for solving practical instances.

6 42 B. Sawik Minimize: m m δ + γ y i + c ik x ijk + i=1 i=1 j=1 k=1 j=1 k=1 g jk (1) subject to β 2 m i=1 j=1 k=1 β 3 ( m ) β 1 y i f opt 1 δ (2) i=1 c ik x ijk f opt δ (3) j=1 k=1 2 g jk f opt δ (4) m i=1 k=1 m i=1 k=1 j=1 k=1 3 c ik x ijk C j, j J (5) e k x ijk E j, j J (6) e k x ijk 2, i I (7) m x ijk h jk, j J, k K (8) i=1 x ijk j=1 k=1 E j j=1 g jk h jk, j J, k K (9) y i j=1 k=1 x ijk, i I (10) x ijk {0, 1}, i I,j J, k K (11) y i {0, 1}, i I (12) g jk 0, j J, k K (13) δ 0 (14) The optimality criterion (1) is to minimize total number of workers selected for an assignment to any job in any department and to minimize operational costs of the supporting services and finally to minimize the number of permanent employments for all jobs in all departments.

7 A Reference Point Method to Triple-Objective Constraints (2), (3) and (4) define the deviation from the reference solution. Constraint (5) ensures that the cost of workers assignment to service jobs in each department must be less than or equal to maximum amount of money paid regularly for services in the department (monthly salaries). Constraint (6) ensures that the total size of permanent (partial or full time) employment for each job (i.e or 0.50 or 0.75 or 1.00) in each department must be less than or equal to the maximal number of permanent employments in this department. Constraint (7) ensures that each worker can be assigned to a maximum two full time positions in parallel. Constraint (8) is responsible for an assignment of workers on at least minimal level requirements, e.g. the number of permanent employments on a selected service jobs. Constraint (9) is responsible for obtaining only the results which will not lead to solutions without any assignment to some jobs. It compares real and minimal accepted number of permanent employments. Constraint (10) ensures that worker i is taken (y i = 1) if he gets assignment to any job in any department ( x ijk = 1 for any j and k ). Constraint (10) defines the relation between binary decision variables x ijk and y i. Constraints (11) and (12) define binary decision variables x ijk and y i. Constraints (13) and (14) define continuous decision variables g jk and δ. 6. COMPUTATIONAL RESULTS In this section numerical examples and some computational results are presented to illustrate possible applications of the proposed formulations of integer programming of optimal assignment of service positions. Selected problem instances with the examples are modeled on a real data from a Polish hospital. In the computational experiments the historical data is considered. Computational time takes only a fraction of a second to find optimal solution if any exists. The computational experiments have been performed using AMPL programming language (Fourer, 1990) and the CPLEX v.11 solver (with the default settings) on a laptop with Intel c Core 2 Duo T9300 processor running at 2.5 GHz and with 4 GB RAM. Table 4 presents the reference point values of parameters for computational experiments with the method optimization model and the size of adjusted problem. Table 4. The values of parameters for computational experiments and the size of adjusted problem Scenario f opt 1 f opt 2 f opt 3 All variables Binary variables Constraints A B C D γ =0.01 β 1 = β 2 =0.34 β 3 =

8 44 B. Sawik Table 5 presents comparison of computational results with alternative scenarios. Table 5. Comparison of computational results with alternative scenarios Scenario δ Number of workers Operational costs PLN Number of permanent employments MIP simplex iterations B&B nodes CPU seconds A , B , C , D , As it has been recommended by the hospital managers four different scenarios of the assignment have been implemented. In scenario A, a minimal number of people is employed in each supporting service department so that each type of a job has at least one worker assigned. This rule is implemented in input parameter h jk.in scenario B at least two workers were assigned to each job. Scenario C secured the level of supporting service workers. In each department there are at least two workers assigned to each job, but for some special cases, more than two workers are assigned to each job. Finally, scenario D presents the optimal assignment of workers to jobs with a high service level with all currently employed workers. The results obtained have indicated the problem of over-employment in the hospital. In Table 5, column MIP simplex iteration shows the number of mixed integer programming simplex iterations until the solution is presented. Column B&B nodes shows the number of searched nodes in the branch and bound tree until presented solution. In Table 6 the number of workers assigned to the supporting service hospital departments and the number of permanent employments is presented. Table 6. Number of workers assigned and number of permanent employments in departments Supporting service Assignment of workers in departments according to scenario departments A B C D workers permanent workers permanent workers permanent workers permanent employments employments employments employments Attorneys-at-law Law Regulation Technical Executive Business Executive Information Material Monitoring Sterilization

9 A Reference Point Method to Triple-Objective Table 6. (continued) Hospital Pharmacy Economy Technical Medical Equipment Distribution Heating and Aircondition Ventilation and Aircondition Medical Bottled Gases Power Central Heating All departments Scenarios A, B, C and D considered subject to hospital authority requirements 7. CONCLUSIONS Operations research techniques, tools and theories have long been applied to a wide range of issues and problems in healthcare. This paper proves the practical usefulness of mathematical programming approach to optimization of supporting service in a hospital. The results of computational experiments modeled after a real data from a hospital in Lesser Poland indicate that the number of hired workers can be reduced in almost all departments of the hospital. The proposed modified multi-objective assignment problem and a reference point approach can be easily implemented for management of supporting services in another institution, not only healthcare. Obtained results consist of the monthly expenses for salaries, the number of workers and the amount of permanent employments needed for jobs in all considered supporting service departments. Computational time takes only a fraction of a second to find the optimal solution because of a relatively small size of the input data. Presented optimization model is NP-hard, but computable. Implementation of reference point method ensures to obtain results with non-dominated set of solutions. The global optimums for considered three objective functions are presented. ACKNOWLEDGEMENTS The author is grateful to an anonymous reviewer for reading the manuscript very carefully and providing constructive comments which helped to substantially improve this paper. This work has been partially supported by Polish Ministry of Science and Higher Education (MNISW) grant for PhD Research #N N and by AGH grant.

10 46 B. Sawik REFERENCES Alves, M.J., Climaco, J., A review of interactive methods for multiobjective integer and mixed-integer programming, European Journal of Operational Research, Vol. 180, pp Bowman Jr, V.J., On the relationship of the Chebyshev norm and the efficient frontier of multi-criteria objectives, [in:] Thiriez H., Zionts S. (Eds.) Multiple Criteria Decision Making, Lecture Notes in Economics and Mathematical Systems, Vol Springer- Verlag, Berlin, Germany, pp Brandeau, M.L., Sainfort, F., Pierskalla, W.P., Operations Research and Health Care. Kluwer Academic Publishers, Boston, USA. Burrkard, R., Dell amico, M., Martello, S., Assignment Problems. SIAM, Philadelphia, USA. Ehrgott, M., Multicriteria Optimization. Second edition, Springer, Berlin, Germany. Fourer, R., Gay, D.M., Kernighan, B.W., A Modeling Language for Mathematical Programming, Management Science, Vol. 36, pp Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimization, John Wiley & Sons, Toronto, Canada. Sawik, B., Reference Point Approach to Assignment of Supporting Services in a Healthcare Institution, chapter [in:] Świerniak A., Krystek J. (Eds.) Automatics of Discrete Processes, Theory and Applications, Vol. 2, Monographic of the Silesian University of Technology, PKJS, Gliwice, Poland, pp Sawik, B., Mikulik, J., 2008a. An Optimal Assignment of Workers to Supporting Services in a Hospital, Polish Journal of Medical Physics and Engineering, Vol. 14(4), Sawik, B., Mikulik, J., 2008b. Model for Supporting Service Optimization in a Public Health Care Institution, EFOMP council and officer s meeting, 14th general assembly of the Polish Society of Medical Physics, European Conference Medical Physics and Engineering 110 years after the discovery of Polonium and Radium, September 2008, Kraków, AGH, Polish Academy of Science, Poland. Sawik, B., 2008c. Bi-Objective Integer Programming Approach to Optimal Assignment of Supporting Services in a Health-Care Institution. The 21st Conference of the European Chapter on Combinatorial Optimization (ECCO XXI) May 29 31, 2008, Dubrovnik, Croatia. Steuer, R.E., Multiple Criteria Optimization: Theory, Computation and Application, John Wiley & Sons, New York, USA.

A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization

AUTOMATYKA 2009 Tom 3 Zeszyt 2 Bartosz Sawik* A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization. Introduction The optimal security selection is a classical portfolio

A Maximal Covering Model for Helicopter Emergency Medical Systems

The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 324 331 A Maximal Covering Model

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver

BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of

Modeling and Solving the Capacitated Vehicle Routing Problem on Trees

in The Vehicle Routing Problem: Latest Advances and New Challenges Modeling and Solving the Capacitated Vehicle Routing Problem on Trees Bala Chandran 1 and S. Raghavan 2 1 Department of Industrial Engineering

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131

Discrete (and Continuous) Optimization Solutions of Exercises 1 WI4 131 Kees Roos Technische Universiteit Delft Faculteit Informatietechnologie en Systemen Afdeling Informatie, Systemen en Algoritmiek

Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra João Clímaco and Marta Pascoal A new method to detere unsupported non-doated solutions

Two stages optimization problem: New variant of Bin Packing Problem for decision making

Proceedings of the International Multiconference on Computer Science and Information Technology pp. 921 925 ISBN 978-83-60810-14-9 ISSN 1896-7094 Two stages optimization problem: New variant of Bin Packing

Two objective functions for a real life Split Delivery Vehicle Routing Problem

International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

NEW VERSION OF DECISION SUPPORT SYSTEM FOR EVALUATING TAKEOVER BIDS IN PRIVATIZATION OF THE PUBLIC ENTERPRISES AND SERVICES

NEW VERSION OF DECISION SUPPORT SYSTEM FOR EVALUATING TAKEOVER BIDS IN PRIVATIZATION OF THE PUBLIC ENTERPRISES AND SERVICES Silvija Vlah Kristina Soric Visnja Vojvodic Rosenzweig Department of Mathematics

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical

The Bi-Objective Pareto Constraint

The Bi-Objective Pareto Constraint Renaud Hartert and Pierre Schaus UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert,pierre.schaus}@uclouvain.be Abstract. Multi-Objective

Scheduling Home Hospice Care with Logic-based Benders Decomposition

Scheduling Home Hospice Care with Logic-based Benders Decomposition Aliza Heching Compassionate Care Hospice John Hooker Carnegie Mellon University CPAIOR 2016 Banff, Canada Home hospice care The Problem

Chapter 13: Binary and Mixed-Integer Programming

Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:

ARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.

A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of

An Exact Algorithm for Steiner Tree Problem on Graphs

International Journal of Computers, Communications & Control Vol. I (2006), No. 1, pp. 41-46 An Exact Algorithm for Steiner Tree Problem on Graphs Milan Stanojević, Mirko Vujošević Abstract: The paper

INTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS. Lucie Galand. LIP6, University of Paris 6, France

INTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS Lucie Galand LIP6, University of Paris 6, France Abstract: In this paper, the purpose is to adapt classical interactive methods

GENERALIZED INTEGER PROGRAMMING

Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA E-mail: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA E-mail: chadhav@uwec.edu GENERALIZED INTEGER

Solving convex MINLP problems with AIMMS

Solving convex MINLP problems with AIMMS By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper August, 2012 Abstract This document describes the Quesada and Grossman algorithm that is implemented

Absolute Value Programming

Computational Optimization and Aplications,, 1 11 (2006) c 2006 Springer Verlag, Boston. Manufactured in The Netherlands. Absolute Value Programming O. L. MANGASARIAN olvi@cs.wisc.edu Computer Sciences

Supply Chain Planning Considering the Production of Defective Products

Supply Chain Planning Considering the Production of Defective Products Ferrara Miguel, Corsano Gabriela, Montagna Marcelo INGAR Instituto de Desarrollo y Diseño CONICET-UTN Avellaneda 3657, Santa Fe, Argentina

Scheduling the Brazilian soccer tournament with fairness and broadcast objectives

Scheduling the Brazilian soccer tournament with fairness and broadcast objectives Celso C. Ribeiro 1 and Sebastián Urrutia 2 1 Department of Computer Science, Universidade Federal Fluminense, Rua Passo

Locating and sizing bank-branches by opening, closing or maintaining facilities

Locating and sizing bank-branches by opening, closing or maintaining facilities Marta S. Rodrigues Monteiro 1,2 and Dalila B. M. M. Fontes 2 1 DMCT - Universidade do Minho Campus de Azurém, 4800 Guimarães,

Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level

Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions

A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität

Supply Chain Management of a Blood Banking System. with Cost and Risk Minimization

Supply Chain Network Operations Management of a Blood Banking System with Cost and Risk Minimization Anna Nagurney Amir H. Masoumi Min Yu Isenberg School of Management University of Massachusetts Amherst,

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Débora P. Ronconi Ernesto G. Birgin April 29, 2010 Abstract Scheduling problems involving

Solution of a Large-Scale Traveling-Salesman Problem

Chapter 1 Solution of a Large-Scale Traveling-Salesman Problem George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson Introduction by Vašek Chvátal and William Cook The birth of the cutting-plane

Linear Programming: Introduction

Linear Programming: Introduction Frédéric Giroire F. Giroire LP - Introduction 1/28 Course Schedule Session 1: Introduction to optimization. Modelling and Solving simple problems. Modelling combinatorial

Using the Simplex Method in Mixed Integer Linear Programming

Integer Using the Simplex Method in Mixed Integer UTFSM Nancy, 17 december 2015 Using the Simplex Method in Mixed Integer Outline Mathematical Programming Integer 1 Mathematical Programming Optimisation

Planning and Scheduling in the Digital Factory

Institute for Computer Science and Control Hungarian Academy of Sciences Berlin, May 7, 2014 1 Why "digital"? 2 Some Planning and Scheduling problems 3 Planning for "one-of-a-kind" products 4 Scheduling

Symmetry Handling in Binary Programs via Polyhedral Methods

Symmetry Handling in Binary Programs via Polyhedral Methods Christopher Hojny joint work with Marc Pfetsch Technische Universität Darmstadt Department of Mathematics 26 International Conference on Mathematical

Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach

Paper Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach Kamil Kołtyś, Piotr Pałka, Eugeniusz Toczyłowski, and Izabela Żółtowska Abstract Since the telecommunication market

Using diversification, communication and parallelism to solve mixed-integer linear programs

Using diversification, communication and parallelism to solve mixed-integer linear programs R. Carvajal a,, S. Ahmed a, G. Nemhauser a, K. Furman b, V. Goel c, Y. Shao c a Industrial and Systems Engineering,

Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem

Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 4, No. 3, Year 2012 Article ID IJIM-00233, 8 pages Research Article Modified Gauss Elimination Technique

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology

FE670 Algorithmic Trading Strategies Lecture 6. Portfolio Optimization: Basic Theory and Practice Steve Yang Stevens Institute of Technology 10/03/2013 Outline 1 Mean-Variance Analysis: Overview 2 Classical

Chapter 2 Goal Programming Variants

Chapter 2 Goal Programming Variants This chapter introduces the major goal programming variants. The purpose and underlying philosophy of each variant are given. The three major variants in terms of underlying

Strategic planning in LTL logistics increasing the capacity utilization of trucks

Strategic planning in LTL logistics increasing the capacity utilization of trucks J. Fabian Meier 1,2 Institute of Transport Logistics TU Dortmund, Germany Uwe Clausen 3 Fraunhofer Institute for Material

A New Method for Multi-Objective Linear Programming Models with Fuzzy Random Variables

383838383813 Journal of Uncertain Systems Vol.6, No.1, pp.38-50, 2012 Online at: www.jus.org.uk A New Method for Multi-Objective Linear Programming Models with Fuzzy Random Variables Javad Nematian * Department

Hub Cover and Hub Center Problems

Hub Cover and Hub Center Problems Horst W. Hamacher, Tanja Meyer Department of Mathematics, University of Kaiserslautern, Gottlieb-Daimler-Strasse, 67663 Kaiserslautern, Germany Abstract Using covering

Integer programming solution methods - introduction

Integer programming solution methods - introduction J E Beasley Capital budgeting There are four possible projects, which each run for 3 years and have the following characteristics. Capital requirements

Load Balancing of Telecommunication Networks based on Multiple Spanning Trees

Load Balancing of Telecommunication Networks based on Multiple Spanning Trees Dorabella Santos Amaro de Sousa Filipe Alvelos Instituto de Telecomunicações 3810-193 Aveiro, Portugal dorabella@av.it.pt Instituto

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery

Optimal Allocation of renewable Energy Parks: A Two Stage Optimization Model. Mohammad Atef, Carmen Gervet German University in Cairo, EGYPT

Optimal Allocation of renewable Energy Parks: A Two Stage Optimization Model Mohammad Atef, Carmen Gervet German University in Cairo, EGYPT JFPC 2012 1 Overview Egypt & Renewable Energy Prospects Case

Core problems in the bi-criteria {0,1}-knapsack: new developments

Core problems in the bi-criteria {0,}-knapsack: new developments Carlos Gomes da Silva (2,3, ), João Clímaco (,3) and José Figueira (3,4) () Faculdade de Economia da Universidade de Coimbra Av. Dias da

A Constraint Programming based Column Generation Approach to Nurse Rostering Problems

Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,

INFLUENCE OF MEASUREMENT SYSTEM QUALITY ON THE EVALUATION OF PROCESS CAPABILITY INDICES

METALLURGY AND FOUNDRY ENGINEERING Vol. 38, 2012, No. 1 http://dx.doi.org/10.7494/mafe.2012.38.1.25 Andrzej Czarski*, Piotr Matusiewicz* INFLUENCE OF MEASUREMENT SYSTEM QUALITY ON THE EVALUATION OF PROCESS

Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints

Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul Renaud-Goud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems

A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms

A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los

A Continuous-Time Formulation for Scheduling Multi- Stage Multi-product Batch Plants with Non-identical Parallel Units

European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. A Continuous-Time Formulation for Scheduling Multi-

In this paper we present a branch-and-cut algorithm for

SOLVING A TRUCK DISPATCHING SCHEDULING PROBLEM USING BRANCH-AND-CUT ROBERT E. BIXBY Rice University, Houston, Texas EVA K. LEE Georgia Institute of Technology, Atlanta, Georgia (Received September 1994;

Optimization Modeling for Mining Engineers

Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2

The multi-integer set cover and the facility terminal cover problem

The multi-integer set cover and the facility teral cover problem Dorit S. Hochbaum Asaf Levin December 5, 2007 Abstract The facility teral cover problem is a generalization of the vertex cover problem.

A Shift Sequence for Nurse Scheduling Using Linear Programming Problem

IOSR Journal of Nursing and Health Science (IOSR-JNHS) e-issn: 2320 1959.p- ISSN: 2320 1940 Volume 3, Issue 6 Ver. I (Nov.-Dec. 2014), PP 24-28 A Shift Sequence for Nurse Scheduling Using Linear Programming

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu

WITH the growing economy, the increasing amount of disposed

IEEE TRANSACTIONS ON ELECTRONICS PACKAGING MANUFACTURING, VOL. 30, NO. 2, APRIL 2007 147 Fast Heuristics for Designing Integrated E-Waste Reverse Logistics Networks I-Lin Wang and Wen-Cheng Yang Abstract

Resource allocation for robust project scheduling

BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 59, No. 1, 2011 DOI: 10.2478/v10175-011-0008-z Varia Resource allocation for robust project scheduling M. KLIMEK 1 and P. ŁEBKOWSKI 2

Integer factorization is in P

Integer factorization is in P Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract A polynomial-time algorithm for integer factorization, wherein integer factorization

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

Nonlinear Systems Modeling and Optimization Using AIMMS /LGO

Nonlinear Systems Modeling and Optimization Using AIMMS /LGO János D. Pintér PCS Inc., Halifax, NS, Canada www.pinterconsulting.com Summary This brief article reviews the quantitative decision-making paradigm,

Supply Chain Design and Inventory Management Optimization in the Motors Industry

A publication of 1171 CHEMICAL ENGINEERING TRANSACTIONS VOL. 32, 2013 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Copyright 2013, AIDIC Servizi S.r.l., ISBN 978-88-95608-23-5; ISSN 1974-9791 The Italian

APPLYING HEURISTIC METHODS FOR JOB SCHEDULING IN STORAGE MARKETS

APPLYING HEURISTIC METHODS FOR JOB SCHEDULING IN STORAGE MARKETS Finkbeiner, Josef, University of Freiburg, Kollegiengebäude II, Platz der Alten Synagoge, 79085 Freiburg, Germany, josef.finkbeiner@is.uni-freiburg.de

Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms

Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms G. Wang, Z. Wan and X. Wang Abstract The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming

Minimizing the Number of Machines in a Unit-Time Scheduling Problem

Minimizing the Number of Machines in a Unit-Time Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.bas-net.by Frank

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA

STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LVI, Number 2, 2011 FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA CYNTHIA VERA GLODEANU Abstract. We compare two methods regarding the factorization

Optimization of Supply Chain Networks

Optimization of Supply Chain Networks M. Herty TU Kaiserslautern September 2006 (2006) 1 / 41 Contents 1 Supply Chain Modeling 2 Networks 3 Optimization Continuous optimal control problem Discrete optimal

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

Solving Method for Linear Fractional Optimization Problem with Fuzzy Coefficients in the Objective Function

INT J COMPUT COMMUN, ISSN 1841-9836 8(1):146-152, February, 2013. Solving Method for Linear Fractional Optimization Problem with Fuzzy Coefficients in the Objective Function B. Stanojević, M. Stanojević

Logic Cuts Generation in a Branch and Cut Framework for Location Problems Mara A. Osorio Lama School of Computer Science Autonomous University of Puebla, Puebla 72560 Mexico Rosalba Mujica Garca Abstract

A hierarchical multicriteria routing model with traffic splitting for MPLS networks

A hierarchical multicriteria routing model with traffic splitting for MPLS networks João Clímaco, José Craveirinha, Marta Pascoal jclimaco@inesccpt, jcrav@deecucpt, marta@matucpt University of Coimbra

Minimizing Cycle Time for PCB Assembly Lines: An Integer Programming Model and a Branch-and-Bound Approach

Information and Management Sciences Volume 19, Number 2, pp. 237-243, 2008 Minimizing Cycle Time for PCB Assembly Lines: An Integer Programming Model and a Branch-and-Bound Approach P. Ji Y. F. Wan Hong

Scheduling Algorithm with Optimization of Employee Satisfaction

Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul.

1 VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK By Kuladej Panapinun and Peerayuth Charnsethikul Abstract Vehicle routing problem (VRP) and its extension

Re-optimization of Rolling Stock Rotations

Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER 1, JULIKA MEHRGARDT 1, MARKUS REUTHER 1, THOMAS SCHLECHTE 1, KERSTIN WAAS 2 Re-optimization

Duplicating and its Applications in Batch Scheduling

Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

Chapter 1, Operations Research (OR)

Chapter 1, Operations Research (OR) Kent Andersen February 7, 2007 The term Operations Research refers to research on operations. In other words, the study of how to operate something in the best possible

Student Project Allocation Using Integer Programming

IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students

Security-Aware Beacon Based Network Monitoring

Security-Aware Beacon Based Network Monitoring Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Graduate School of Informatics, Kyoto University, Kyoto, Japan Email: {sasaki, liang, nag}@amp.i.kyoto-u.ac.jp

Scheduling and (Integer) Linear Programming

Scheduling and (Integer) Linear Programming Christian Artigues LAAS - CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012 - Nantes Christian Artigues Scheduling and (Integer)

A Robust Formulation of the Uncertain Set Covering Problem

A Robust Formulation of the Uncertain Set Covering Problem Dirk Degel Pascal Lutter Chair of Management, especially Operations Research Ruhr-University Bochum Universitaetsstrasse 150, 44801 Bochum, Germany

High-performance local search for planning maintenance of EDF nuclear park

High-performance local search for planning maintenance of EDF nuclear park Frédéric Gardi Karim Nouioua Bouygues e-lab, Paris fgardi@bouygues.com Laboratoire d'informatique Fondamentale - CNRS UMR 6166,

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

A Study of Local Optima in the Biobjective Travelling Salesman Problem

A Study of Local Optima in the Biobjective Travelling Salesman Problem Luis Paquete, Marco Chiarandini and Thomas Stützle FG Intellektik, Technische Universität Darmstadt, Alexanderstr. 10, Darmstadt,

A mathematical programming approach for scheduling physicians in the emergency room

Health Care Management Science 3 (2000) 193 200 193 A mathematical programming approach for scheduling physicians in the emergency room Huguette Beaulieu a, Jacques A. Ferland b, Bernard Gendron b, and

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

On the Improvement of Blood Sample Collection at a Clinical Laboratory

On the Improvement of Blood Sample Collection at a Clinical Laboratory Running head: On the Improvement of Blood Sample Collection List of authors: Helena R. Lourenço: Associate Professor. Department of

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr

Randomization Approaches for Network Revenue Management with Customer Choice Behavior

Randomization Approaches for Network Revenue Management with Customer Choice Behavior Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu March 9, 2011

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 15 Limited Resource Allocation Today we are going to be talking about

Module 3 Lecture Notes 2. Graphical Method

Optimization Methods: Linear Programming- Graphical Method Module Lecture Notes Graphical Method Graphical method to solve Linear Programming problem (LPP) helps to visualize the procedure explicitly.

Minimum Caterpillar Trees and Ring-Stars: a branch-and-cut algorithm

Minimum Caterpillar Trees and Ring-Stars: a branch-and-cut algorithm Luidi G. Simonetti Yuri A. M. Frota Cid C. de Souza Institute of Computing University of Campinas Brazil Aussois, January 2010 Cid de

USING EXCEL SOLVER IN OPTIMIZATION PROBLEMS

USING EXCEL SOLVER IN OPTIMIZATION PROBLEMS Leslie Chandrakantha John Jay College of Criminal Justice of CUNY Mathematics and Computer Science Department 445 West 59 th Street, New York, NY 10019 lchandra@jjay.cuny.edu

WORKFLOW ENGINE FOR CLOUDS

WORKFLOW ENGINE FOR CLOUDS By SURAJ PANDEY, DILEBAN KARUNAMOORTHY, and RAJKUMAR BUYYA Prepared by: Dr. Faramarz Safi Islamic Azad University, Najafabad Branch, Esfahan, Iran. Workflow Engine for clouds

Discrete Optimization

Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using