HIERARCHICAL SCHEDULING FOR DECISION SUPPORT
|
|
- Myrtle Hensley
- 8 years ago
- Views:
Transcription
1 Journal of Intelligent Manufacturing, vol.6, N 2, pp , 2005 HIERARCHICAL SCHEDULING FOR DECISION SUPPORT Gérard FONTAN,2, Colette MERCE,3, Jean-Claude HENNET, Jean B. LASSERRE LAAS-CNRS, 7 avenue du Colonel Roche, 3077 Toulouse cedex 4, France, fontan, merce, hennet, lasserre@laas.fr 2 Institut National Polytechnique de Toulouse, 3 Institut National des Sciences Appliquées de Toulouse Abstract: Key words: The paper proposes a two-level scheduling structure based on time aggregation. The main purposes of the upper-level are to help the decision maker in the choice of managerial decisions and to optimally distribute production over time. The main objective of the lower level is to implement the upper-level decisions as efficiently as possible. The study validates the feasibility and efficiency of the proposed structure. Hierarchical scheduling, aggregation, robustness, validation. INTRODUCTION Classically, the role of a production scheduling module is to precisely locate in time the manufacturing operations on resources. In order to satisfy the need for taking into account future predicted data, such a module is often run on a medium-term horizon basis. However, within such a timehorizon, the operations scheduling problem can only be solved in an approximate manner by heuristics such as the ones based on local priority rules. An other possible approach to compensate for the inherent shortsightedness of precise scheduling modules is through hierarchical planning structures with several decision levels. Such structures have been conceptually analysed (Schneeweiss 995). The literature on this subject can be partitioned into three main classes. The first class is concerned with hierarchical planning (Bitran 977), in which each decisional level determines production volumes at the concerned product aggregation level. The second class considers hierarchical structures integrating planning and scheduling (Gelders 974, Hax 975, Lasserre 992, Das 2000, Qiu 200). In such a framework, the upper level determines production volumes, while
2 2 Journal of Intelligent Manufacturing, vol.6, N 2, pp , 2005 the lower level schedules tasks on resources. In the third class, the scheduling problem is treated through a hierarchical structure. Tasks are scheduled on resources in a more or less aggregated manner, according to the considered decisional level. Most of the papers in this class relate to computer systems. Only few of them are applied to manufacturing systems. And they generally focuse on resource aggregation, either in the context of classical manufacturing systems (Tsukiyama 998) or more frequently flexible manufacturing systems (Tung 999). The work presented in this paper belongs to this third class. The upper level of aggregate scheduling operates on a medium-term horizon divided into time buckets. Production Orders (POs) are located over the time buckets so as to optimize an objective function derived from costs and managerial preferences. They are subject to constraints reflecting an aggregated view of resource capacity and requirements. The lower level finely decides on the time location of operations, so as to fulfil the PO planning decisions coming from the upper level and satisfy the detailed constraints, describing the limitations in the use of resources. This work has been conducted in cooperation with a software and service company, active in the market of scheduling packages. Its major scheduling product, ORDO, already has the originality of integrating off-line scheduling and real-time scheduling. In this study, this existing scheduling module is used at the lower level. The aggregate scheduling module, currently under investigation, has two promising missions: one is to improve the results of the scheduling module through a more efficient time allocation of the POs, and the second one is to bridge the gap between managerial and operational decisions. This paper is divided into 4 sections. The second section briefly describes the problem under study and the characteristics of the detailed scheduling module. The third section presents the aggregate scheduling module with its objectives, model and underlying assumptions. The two purposes of the fourth part are to validate the aggregate model and to evaluate its efficiency. The global two-level structure is studied and the quality of its results is compared to the quality of the results of the scheduling module alone. 2. FRAMEWORK OF THE STUDY The basic problem investigated in this article concerns the construction of an execution schedule for manufacturing tasks belonging to various production orders denoted PO. A production order (PO) with index i is characterized by an earliest starting date es i, a due date dd i, a partially ordered set of NT i elementary tasks. Each task j has a deterministic duration p ij and a given consumption m ijr of each resource r used. Each resource r has a capacity CAP rt over a given time period, denoted t. In order to complete production, several decisional mechanisms are available to the decision maker. In a first approach, this work considers three traditional degrees of freedom: the use of overtime work to further increase the resource capacity (in the model, OVT is the maximal volume of overtime), the allowance to finish the POs after their due date, 2
3 Journal of Intelligent Manufacturing, vol.6, N 2, pp , the use of subcontracting for completing certain POs. These tools allow for a global adjustment of load to capacity. It is important to take them into account when analyzing and optimizing the task scheduling problem. A possible management scenario can then be represented by the relative priorities that a decision maker assigns to these three management tools. Within this framework, the purpose of the module is twofold. On the one hand, it helps the decision maker in the choice of the best management scenario. On the other hand, it provides a decision support and monitoring system for job and task scheduling. The considered detailed scheduling software ORDO is currently commercialized and used by many companies in various fields of activity (mechanical industry, car equipment). This module consists of two sub-modules corresponding to the two following functions (Billaut 996): position the tasks in time and assign them to resources, based on the detailed data describing production orders (POs) (sequence, task duration, resources, resource capacity, work calendar, due date) start tasks on resources in real-time so as to satisfy the due dates of the POs as well as possible. Such a goal is achieved through observing the real state of the production unit, and using the autonomy embodied in the planned schedule. It is worth mentioning that in order to perform a precise positioning of tasks, this module operates in continuous time. 3. THE AGGREGATE SCHEDULING MODULE 3. The desired functions The aggregate scheduling module is in charge of two functions: helping for managerial decisions within the framework of a Decision Support System (DSS). A set of available managerial tools should be taken into account: management of overtime, delays, subcontracted tasks. constructing an optimal production plan for the POs, within the framework of the selected managerial options. The aggregate module should help positioning the POs in time, by determining the optimal starting and finishing dates, by defining and programming the volumes of overtime, the numbers of POs to be sub-contracted, the late POs. In this way, the decision maker is able to test different scenarios which correspond to different sets of preferences. He can also measure the influence of his choices in terms of costs and duration. Figure represents these various elements. 3.2 Basic features of the aggregate scheduling module Management preferences are represented in the model through the magnitude of decisional parameters. The relative importance attached to these parameters is 3
4 4 Journal of Intelligent Manufacturing, vol.6, N 2, pp , 2005 represented in the objective function by the weights assigned to the corresponding terms. Aggregate scheduling module Managerial options PO sequence desired starting and finishing dates Aggregate scheduling Optimal plan for POs :planned starting and ending periods Planned overtime and sub-contracting Change of management preferences o n Validation by decision maker es y Detailed planned schedule Detailed scheduling module Task scheduling Task starting orders Figure. Two-level hierarchical scheduling In order to provide a global view of the optimisation process, a mid-term timehorizon is selected. And to reduce complexity, the time horizon is discretized into time buckets with different lengths: shorter by the beginning of the horizon, and longer by the end. D t represents the length of period t.this type of time aggregation allows to limit the effects of the uncertainty on data, in particular through error compensating mechanisms. It is important to note that this module works in discrete time, as opposed to the detailed scheduling module, for which time is continuous, as previously mentioned. Time aggregation implies an aggregation of resource capacity over the various time buckets of the considered time horizon. 3.3 The basic model The model associated to the aggregate scheduling problem is constructed from the problem data described in section 2 and from the following variables. X ijt : Binary variable with value if task j of PO i is executed in period t, 0 if not. O rt : Number of overtime hours allocated to resource r on period t R i : Number of periods of tardiness for PO i 4
5 Journal of Intelligent Manufacturing, vol.6, N 2, pp , A i : Number of periods of advance for PO i. S i : Variable with value if PO i is sub-contracted, 0 if not. The problem constraints are listed below: T Xijt + S = i =,,NPO j =,,NT i [] i t= t t X ijk Xij+ k i =,,NPO j =,,NT i - t =,,T [2] k= k= NPO NTi mijr Xijt CAPrt + Ort r =,,NR t =,,T [3] i= j= T t XiNTit ddi(-s i) = R t= esi Xijt t= = 0 i - A i i =,,NPO [4] j =,,NT i [5] NTi p ij Xijt Dt i =,,NPO t =,,T [6] j= O rt OVT r =,,NR t =,,T [7] R i, Ai, Ort 0 i =,,NPO r =,,NR t =,,T [8] { 0, } Xijt,Si i =,,NPO j =,,NT i t =,,T [9] and the selected criterion is: NR T NPO NPO NPO min Z = co_ovt Ort + co_tar Ri + co_adv Ai + co_sbc Si r= t= i= i= i= Constraint [] guarantees execution of all the POs, either in the manufacturing unit or through subcontracting. Constraint [2] imposes the task sequence to be consistent with the manufacturing sequence. Constraint [3] represents the limits on resource capacity. Constraint [4] generates the value of earliness or tardiness for each PO. Constraint [5] imposes to satisfy the constraint of earliest starting date for each PO. Constraint [6] imposes the feasibility limit on the sum of task durations within each period. The objective function represents the management preferences, through the selected terms (decision parameters) and the weights associated. Accordingly, co_ovt, co_tar, co_adv, co_sbc, respectively characterize the unit cost of overtime, tardiness, earliness and subcontracting. In this expression, the possibility to penalize earliness has been introduced, in agreement with a just-intime approach. 5
6 6 Journal of Intelligent Manufacturing, vol.6, N 2, pp , Robustness of the hierarchical approach Previous studies have shown that perfect robustness cannot always be achieved, either because of a theoretical impossibility, or due to an inacceptable increase of complexity of the aggregate model. It has been shown that, under certain conditions, partial robustness properties can be obtained trough a computationally reasonable treatment of detailed data and an adaptation of aggregated variables (Fontan 994). In the framework of aggregate scheduling, the partial robustness property is obtained from the two following elements : by considering the full set of tasks (no task aggregation) by over-constraining the aggregate level. This can be achieved through an underestimation of the aggregate capacity of each resource and through a reduction of each period duration. Accordingly, the underestimation coefficients, α for the aggregate capacity and β for the period duration, are introduced in the constraints of the model. Constraints [3] et [6] are now written as follows: NPO NT i i= j= NT i j= m ijr X ijt α CAP + O r =,,NR t =,,T [3 ] rt rt p X β D i =,,NPO t =,,T [6 ] ij ijt t 4. NUMERICAL EXPERIMENTS AND VALIDATION The purpose of the numerical experiments is to evaluate the following properties: a) Computational burden, b) Quality of results, c) Coherency of results. The mixed variable LP problem was solved using the LP-solver XPRESSMP (version 2) on a SUN workstation or on a PC. 4. Results on an academic sample. The purpose of this section is to show on small size examples that computation times may drastically change with the nature of data. In particular, this property is related to the resource load. The global load rate associated to resource r is defined NPO NTi T by : ch r = mijr /( CAPrt). i= j= t= The data of the academic samples have been randomly generated. Table presents the computing times obtained on two data samples of respectively 50 and 75 POs for different values of the global load rate. 6
7 Journal of Intelligent Manufacturing, vol.6, N 2, pp , Number of PO Max load rate CPU times (s) * 69* * Max load rate CPU times (s) 2 88* 95* 829* 65* 08* * Exploration was interrupted after obtaining the first integer solution. Table. Computing times Table shows an increase of computing times with the load rate for load rates smaller than 0.7. Then, for greater load rates, computing times decrease with the load rate, as a result of the decrease of combinatorial possibilities, due to the importance of subcontracts. 4.2 Results on data from a real-life problem. Experiments on real-life industrial data have the following goals: (a) to validate the aggregate scheduling module, (b) to validate the complete two-level hierarchical scheduling approach. The main characteristics of the data set are as follows: there are 54 POs, 62 elementary operations and 64 different resources. The months time horizon is discretized into 2 one week periods followed by 2 two-week periods and 7 fourweek periods. Different experiments have been conducted in order to evaluate: the solution obtained from the detailed scheduling sub-module in isolation, the solution obtained from the complete two-level hierarchical approach. An optimal solution of the (upper level) aggregate scheduling module determines the starting and finishing dates of the POs which now become input data for the (lower level) detailed scheduling module. The latter (lower level) scheduling module determines a schedule for the elementary operations of all the POs that satisfy the constraints of dates fixed by the upper level. The results are displayed in Table 2 below. Detailed scheduling module operating alone Hierarchical scheduling approach Number of POs on time or in advance Number of late POs 6 93 α = β = 9 63 α = 0.8 β = 0 53 α = β = α = 0.9 β = α = 0.8 β = Table 2. Performance of the PO schedule obtained by the detailed module alone and by the hierarchical system The results clearly show a significant decrease of the number of late POs when using the hierarchical approach instead of the detailed scheduling module alone. This is due to optimization of starting and finishing dates of POs by the aggregate scheduling module. 7
8 8 Journal of Intelligent Manufacturing, vol.6, N 2, pp , CONCLUSION Numerical experiments have clearly shown the benefit of using the proposed twolevel hierarchical approach rather than the usual one-level detailed scheduling approach. This benefit has been evaluated in terms of the number of late POs and indeed, a significant decrease has been observed. However, it is the robustness of our scheme which is the essential condition for its successful application in practice. This work has shown that robustness can be achieved at the expense of adjusting some aggregate level parameters so as to provide the lower-level detailed scheduling module with the autonomy needed to meet the constraints on date requirements determined at the upper level. Furthermore, the novelty of the proposed two-level approach should be stressed, since the role of the upper level is twofold. On the one hand, the upper level determines a mid-term policy for adjusting load to capacity, on the other, this level enforces feasibility of the detailed scheduling problem. 6. REFERENCES [] Billaut J.C. and F. Roubellat, 996, A new method for workshop real time scheduling, International Journal of Production Research 35, [2] Bitran G.R. and A.C. Hax, 977, On the design of hierarchical production planning systems, Decision Science 8, [3] Das B.P., J.G. Rickard, N. Shan and S. Macchietto, 2000, Investigation on integration of aggregate production planning, master production scheduling and short term production scheduling of batch process operations through a common data model, Computer and Chemical Engineering 24, [4] Fontan G., G. Hetreux and C. Merce, 994, Consistency of decisions in multilevel production planning: analysis and implementation, IEEE International conference on systems, man and cybernetics (SCM94), San Antonio (USA) October 2-5, 994. [5] Gelders L.F., 974, Coordinating aggregate and detailed scheduling in the one machine job shop: theory, Operations Research 22, [6] Hax A.C. and H.C. Meal, 975, Hierarchical integration of production planning and scheduling in M. Geisler (editor); TIMS studies in management science, Logistics, North Holland, American Elsevier, New York. [7] Lasserre J.B., 992, An integrated model for job shop planning and scheduling, Management Science 38, [8] Qiu M.M., L.D. Fredendall and Z. Zhu, 200, Application of hierarchical production planning in a multiproduct, multimachine environment, International Journal of Production Research 39, [9] Schneeweis C., 995, Hierarchical structure in organizations: a conceptual framework, European Journal of Operational Research 8, 4-3. [0] Tsukiyama M., K. Mori and T. Fukuda, 998, Hierarchical distributed algorithm for large scale manufacturing systems, IFAC IFORS IMACS IFIP Symposium on large scale systems theory and applications, Patras, Greece. [] Tung L.F., L. Lin and R. Nagir, 999,Multiple objective scheduling for the hierarchical control of flexible manufacturing systems, International Journal of Flexible Manufacturing Systems,
From the Aggregate Plan to Lot-Sizing in Multi-level Production Planning
From the Aggregate Plan to Lot-Sizing in Multi-level Production Planning Jean-Claude Hennet LAAS-CNRS, 7 Ave. Colonel Roche, 31077 Toulouse FRANCE 1 INTRODUCTION The hierarchical approach to production
More informationSupply 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,
More informationA joint control framework for supply chain planning
17 th European Symposium on Computer Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 A joint control framework for supply chain planning
More informationOptimal 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
More informationA Rough-Cut Capacity Planning Model with Overlapping
1 A Rough-Cut Capacity Planning Model with Overlapping Baydoun G. 1, Haït A. 2 and Pellerin R. 1 1 École Polytechnique de Montréal, Montréal, Canada georges.baydoun, robert.pellerin@polymlt.ca 2 University
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationDimensioning an inbound call center using constraint programming
Dimensioning an inbound call center using constraint programming Cyril Canon 1,2, Jean-Charles Billaut 2, and Jean-Louis Bouquard 2 1 Vitalicom, 643 avenue du grain d or, 41350 Vineuil, France ccanon@fr.snt.com
More informationThe Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop
More informationRevenue Management for Transportation Problems
Revenue Management for Transportation Problems Francesca Guerriero Giovanna Miglionico Filomena Olivito Department of Electronic Informatics and Systems, University of Calabria Via P. Bucci, 87036 Rende
More informationEnergy Management for Heat Intensive Production Plants using Mixed Integer Optimization
20 th European Symposium on Computer Aided Process Engineering ESCAPE20 S. Pierucci and G. Buzzi Ferraris (Editors) 2010 Elsevier B.V. All rights reserved. Energy Management for Heat Intensive Production
More informationAdvanced Planning in Supply Chains - Illustrating the Concepts Using an SAP APO Case Study
Advanced Planning in Supply Chains - Illustrating the Concepts Using an SAP APO Case Study 2 Hierarchical Planning and the Supply Chain Planning Matrix Contents 2 Hierarchical Planning and the Supply Chain
More informationConstraints Propagation Techniques in Batch Plants Planning and Scheduling
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. Constraints Propagation Techniques in Batch Plants
More informationA Tool for Generating Partition Schedules of Multiprocessor Systems
A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.
More informationA New Approach for Efficient Rescheduling of Multiproduct Batch Plants
4228 Ind. Eng. Chem. Res. 2000, 39, 4228-4238 A New Approach for Efficient Rescheduling of Multiproduct Batch Plants Jeetmanyu P. Vin and Marianthi G. Ierapetritou* Department of Chemical and Biochemical
More informationA CP Scheduler for High-Performance Computers
A CP Scheduler for High-Performance Computers Thomas Bridi, Michele Lombardi, Andrea Bartolini, Luca Benini, and Michela Milano {thomas.bridi,michele.lombardi2,a.bartolini,luca.benini,michela.milano}@
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More informationSTRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL
Session 6. Applications of Mathematical Methods to Logistics and Business Proceedings of the 9th International Conference Reliability and Statistics in Transportation and Communication (RelStat 09), 21
More informationScheduling in a Virtual Enterprise in the Service Sector
Scheduling in a Virtual Enterprise in the Service Sector Florian Kandler Electronic Commerce Competence Center, Donau-City-Strasse, 7 Vienna, Austria florian.kandler@ec,at http://www.ec.at/ Abstract. The
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More information5 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
More informationMIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving
More informationOptimising Patient Transportation in Hospitals
Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction
More informationIntegrating Benders decomposition within Constraint Programming
Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,jussien}@emn.fr École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BP
More informationThe truck scheduling problem at cross-docking terminals
The truck scheduling problem at cross-docking terminals Lotte Berghman,, Roel Leus, Pierre Lopez To cite this version: Lotte Berghman,, Roel Leus, Pierre Lopez. The truck scheduling problem at cross-docking
More informationENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR THE CLOUD
ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR THE CLOUD ENRICA ZOLA, KARLSTAD UNIVERSITY @IEEE.ORG ENGINEERING AND CONTROL FOR RELIABLE CLOUD SERVICES,
More informationA Mathematical Programming Solution to the Mars Express Memory Dumping Problem
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem Giovanni Righini and Emanuele Tresoldi Dipartimento di Tecnologie dell Informazione Università degli Studi di Milano Via Bramante
More informationAlternative Job-Shop Scheduling For Proton Therapy
Alternative Job-Shop Scheduling For Proton Therapy Cyrille Dejemeppe ICTEAM, Université Catholique de Louvain (UCLouvain), Belgium, cyrille.dejemeppe@uclouvain.be Director: Yves Deville (ICTEAM, UCLouvain)
More informationOnline Scheduling for Cloud Computing and Different Service Levels
2012 IEEE 201226th IEEE International 26th International Parallel Parallel and Distributed and Distributed Processing Processing Symposium Symposium Workshops Workshops & PhD Forum Online Scheduling for
More informationA MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY CAPACITY PLANNING
A MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY Yung-Cheng (Rex) Lai, Assistant Professor, Department of Civil Engineering, National Taiwan University, Rm 313, Civil Engineering Building,
More informationScheduling using Optimization Decomposition in Wireless Network with Time Performance Analysis
Scheduling using Optimization Decomposition in Wireless Network with Time Performance Analysis Aparna.C 1, Kavitha.V.kakade 2 M.E Student, Department of Computer Science and Engineering, Sri Shakthi Institute
More informationIntegrated maintenance scheduling for semiconductor manufacturing
Integrated maintenance scheduling for semiconductor manufacturing Andrew Davenport davenport@us.ibm.com Department of Business Analytics and Mathematical Science, IBM T. J. Watson Research Center, P.O.
More informationA 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
More informationDuplicating 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
More informationA 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
More informationAvailable online at www.sciencedirect.com Available online at www.sciencedirect.com. Advanced in Control Engineering and Information Science
Available online at www.sciencedirect.com Available online at www.sciencedirect.com Procedia Procedia Engineering Engineering 00 (2011) 15 (2011) 000 000 1822 1826 Procedia Engineering www.elsevier.com/locate/procedia
More informationIntegrated support system for planning and scheduling... 2003/4/24 page 75 #101. Chapter 5 Sequencing and assignment Strategies
Integrated support system for planning and scheduling... 2003/4/24 page 75 #101 Chapter 5 Sequencing and assignment Strategies 5.1 Overview This chapter is dedicated to the methodologies used in this work
More informationA Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem
A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem John Karlof and Peter Hocking Mathematics and Statistics Department University of North Carolina Wilmington Wilmington,
More informationECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.
More information8th IFAC/IFIP/IFORS/IEA Symposium on Analysis, Design, and Evaluation of Human-Machine Systems, September 18 th -20 th, 2001
APPLICATION OF MATHEMATICAL PRINCIPLES TO THE FORMALISATION OF A SYSTEM- BASED MODELLING FRAMEWORK : APPLICATION TO ENTERPRISE SYSTEMS F. Mayer and J.P. Lavigne LRGSI (Industrial System Engineering Research
More informationA MODEL TO SOLVE EN ROUTE AIR TRAFFIC FLOW MANAGEMENT PROBLEM:
A MODEL TO SOLVE EN ROUTE AIR TRAFFIC FLOW MANAGEMENT PROBLEM: A TEMPORAL AND SPATIAL CASE V. Tosic, O. Babic, M. Cangalovic and Dj. Hohlacov Faculty of Transport and Traffic Engineering, University of
More informationMotivated by a problem faced by a large manufacturer of a consumer product, we
A Coordinated Production Planning Model with Capacity Expansion and Inventory Management Sampath Rajagopalan Jayashankar M. Swaminathan Marshall School of Business, University of Southern California, Los
More informationLocal periods and binary partial words: An algorithm
Local periods and binary partial words: An algorithm F. Blanchet-Sadri and Ajay Chriscoe Department of Mathematical Sciences University of North Carolina P.O. Box 26170 Greensboro, NC 27402 6170, USA E-mail:
More informationProject management: a simulation-based optimization method for dynamic time-cost tradeoff decisions
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2009 Project management: a simulation-based optimization method for dynamic time-cost tradeoff decisions Radhamés
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationEvaluation of the Time Needed for e-learning Course Developing *
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 3 Sofia 2009 Evaluation of the Time Needed for e-learning Course Developing * Petar Halachev, Ivan Mustakerov Institute
More informationResource grouping selection to minimize the maximum over capacity planning
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Resource grouping selection to minimize the maximum over capacity
More informationAnalysis of the critical path within a project with WinQSB software
Analysis of the critical path within a project with WinQSB software GURAU MARIAN ANDREI, MELNIC LUCIA VIOLETA Faculty of Engineering and Technological Systems Management, Faculty of Mechanical Engineering
More informationjobs that obey the norms must ensure the load balancing qualities. Load balancing should be interpreted as releasing a balanced mix of jobs to the
Summary The term job shops is used to indicate companies that produce customer-specific components in small batches. Jobs (production orders) in a job shop are characterised by a large variety of routings
More informationImprove Net Present Value using cash flow weight
2011 2 nd International Conference on Construction and Project Management IPEDR vol.15 (2011) (2011) IACSIT Press, Singapore Improve Net Present Value using cash flow weight Vacharee Tantisuvanichkul 1
More informationDesign, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation
Computers and Chemical Engineering 25 (2001) 665 674 www.elsevier.com/locate/compchemeng Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation X. Lin,
More informationVEHICLE ROUTING PROBLEM
VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem
More informationMULTI-CRITERIA PROJECT PORTFOLIO OPTIMIZATION UNDER RISK AND SPECIFIC LIMITATIONS
Business Administration and Management MULTI-CRITERIA PROJECT PORTFOLIO OPTIMIZATION UNDER RISK AND SPECIFIC LIMITATIONS Jifií Fotr, Miroslav Plevn, Lenka vecová, Emil Vacík Introduction In reality we
More informationProject Scheduling to Maximize Fuzzy Net Present Value
, July 6-8, 2011, London, U.K. Project Scheduling to Maximize Fuzzy Net Present Value İrem UÇAL and Dorota KUCHTA Abstract In this paper a fuzzy version of a procedure for project scheduling is proposed
More informationJun Gang, 1 Jiuping Xu, 1,2 and Yinfeng Xu 1. 1. Introduction
Journal of Applied Mathematics Volume 2013, Article ID 818731, 19 pages http://dx.doi.org/10.1155/2013/818731 Research Article Multiproject Resources Allocation Model under Fuzzy Random Environment and
More informationStiffie's On Line Scheduling Algorithm
A class of on-line scheduling algorithms to minimize total completion time X. Lu R.A. Sitters L. Stougie Abstract We consider the problem of scheduling jobs on-line on a single machine and on identical
More informationManagement of Software Projects with GAs
MIC05: The Sixth Metaheuristics International Conference 1152-1 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad
More informationDetermining Inventory Levels in a CONWIP Controlled Job Shop
Determining Inventory Levels in a CONWIP Controlled Job Shop Sarah M. Ryan* Senior Member, IIE Department of Industrial and Management Systems Engineering University of Nebraska-Lincoln Lincoln, NE 68588-0518
More informationComputer based Scheduling Tool for Multi-product Scheduling Problems
Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Adirake Chainual, Tawatchai Lutuksin and Pupong Pongcharoen Department
More informationAn Extension Model of Financially-balanced Bonus-Malus System
An Extension Model of Financially-balanced Bonus-Malus System Other : Ratemaking, Experience Rating XIAO, Yugu Center for Applied Statistics, Renmin University of China, Beijing, 00872, P.R. China Phone:
More informationPROJECT-ORIENTED APPROACH TO PRODUCTION PLANNING AND SCHEDULING IN MAKE-TO-ORDER MANUFACTURING
Production Systems and Information Engineering Volume 2 (2004), pp. 23-36 23 PROJECT-ORIENTED APPROACH TO PRODUCTION PLANNING AND SCHEDULING IN MAKE-TO-ORDER MANUFACTURING PÉTER EGRI, ANDRÁS KOVÁCS, ANDRÁS
More informationClustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating
More informationBilevel Models of Transmission Line and Generating Unit Maintenance Scheduling
Bilevel Models of Transmission Line and Generating Unit Maintenance Scheduling Hrvoje Pandžić July 3, 2012 Contents 1. Introduction 2. Transmission Line Maintenance Scheduling 3. Generating Unit Maintenance
More informationTwo 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
More informationChapter 7. Production, Capacity and Material Planning
Chapter 7 Production, Capacity and Material Planning Production, Capacity and Material Planning Production plan quantities of final product, subassemblies, parts needed at distinct points in time To generate
More informationSales and Operations Planning in Company Supply Chain Based on Heuristics and Data Warehousing Technology
Sales and Operations Planning in Company Supply Chain Based on Heuristics and Data Warehousing Technology Jun-Zhong Wang 1 and Ping-Yu Hsu 2 1 Department of Business Administration, National Central University,
More informationThe Impact of Big Data on Classic Machine Learning Algorithms. Thomas Jensen, Senior Business Analyst @ Expedia
The Impact of Big Data on Classic Machine Learning Algorithms Thomas Jensen, Senior Business Analyst @ Expedia Who am I? Senior Business Analyst @ Expedia Working within the competitive intelligence unit
More informationJUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
More informationHow To Design A Supply Chain For A New Market Opportunity
int. j. prod. res., 01 June 2004, vol. 42, no. 11, 2197 2206 Strategic capacity planning in supply chain design for a new market opportunity SATYAVEER S. CHAUHANy, RAKESH NAGIz and JEAN-MARIE PROTHy* This
More informationUniversidad del Turabo MANA 705 DL Workshop Eight W8_8_3 Aggregate Planning, Material Requirement Planning, and Capacity Planning
Aggregate, Material Requirement, and Capacity Topic: Aggregate, Material Requirement, and Capacity Slide 1 Welcome to Workshop Eight presentation: Aggregate planning, material requirement planning, and
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationDevelopment of a decision support tool for supply network planning: A case study from the chemical industry
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 18 24 Development of a decision support
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
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
More informationBranch-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
More information2004 Networks UK Publishers. Reprinted with permission.
Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET
More informationScheduling 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
More informationQoS optimization for an. on-demand transportation system via a fractional linear objective function
QoS optimization for an Load charge ratio on-demand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
More informationIntelligent Search Heuristics for Cost Based Scheduling. Murphy Choy Michelle Cheong. Abstract
Intelligent Search Heuristics for Cost Based Scheduling Murphy Choy Michelle Cheong Abstract Nurse scheduling is a difficult optimization problem with multiple constraints. There is extensive research
More informationProduct Documentation SAP Business ByDesign 1302. Supply Chain Planning and Control
Product Documentation PUBLIC Supply Chain Planning and Control Table Of Contents 1 Supply Chain Planning and Control.... 6 2 Business Background... 8 2.1 Demand Planning... 8 2.2 Forecasting... 10 2.3
More informationProject Scheduling: PERT/CPM
Project Scheduling: PERT/CPM CHAPTER 8 LEARNING OBJECTIVES After completing this chapter, you should be able to: 1. Describe the role and application of PERT/CPM for project scheduling. 2. Define a project
More informationResearch Article Scheduling IT Staff at a Bank: A Mathematical Programming Approach
e Scientific World Journal, Article ID 768374, 10 pages http://dx.doi.org/10.1155/2014/768374 Research Article Scheduling IT Staff at a Bank: A Mathematical Programming Approach M.Labidi,M.Mrad,A.Gharbi,andM.A.Louly
More informationResearch Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationPrediction of DDoS Attack Scheme
Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and
More informationCOMBINING THE METHODS OF FORECASTING AND DECISION-MAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES
COMBINING THE METHODS OF FORECASTING AND DECISION-MAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES JULIA IGOREVNA LARIONOVA 1 ANNA NIKOLAEVNA TIKHOMIROVA 2 1, 2 The National Nuclear Research
More informationA Distributed Render Farm System for Animation Production
A Distributed Render Farm System for Animation Production Jiali Yao, Zhigeng Pan *, Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University, Hangzhou, 310058, China {yaojiali, zgpan, zhx}@cad.zju.edu.cn
More informationContinuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering
More informationA 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-
More informationA SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES
A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University
More informationHigh-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,
More informationIssues in Information Systems Volume 14, Issue 2, pp.353-358, 2013
A MODEL FOR SIMULTANEOUS DECISIONS ON MASTER PRODUCTION SCHEDULING, LOT SIZING, AND CAPACITY REQUIREMENTS PLANNING Harish C. Bahl, California State University-Chico, hbahl@csuchico.edu Neelam Bahl, California
More informationOn the Interaction and Competition among Internet Service Providers
On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers
More informationFactors to Describe Job Shop Scheduling Problem
Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus
More informationA Constraint Programming Application for Rotating Workforce Scheduling
A Constraint Programming Application for Rotating Workforce Scheduling Markus Triska and Nysret Musliu Database and Artificial Intelligence Group Vienna University of Technology {triska,musliu}@dbai.tuwien.ac.at
More informationProblems, Methods and Tools of Advanced Constrained Scheduling
Problems, Methods and Tools of Advanced Constrained Scheduling Victoria Shavyrina, Spider Project Team Shane Archibald, Archibald Associates Vladimir Liberzon, Spider Project Team 1. Introduction In this
More informationAgent-based Modeling to Support Operations Management in a. Multi-plant Enterprise
Agent-based Modeling to Support Operations Management in a Multi-plant Enterprise Behzad Behdani 1, Zofia Lukszo 1, Arief Adhitya 2 and Rajagopalan Srinivasan 2,3 1 Faculty of Technology, Policy and Management,
More informationIntroduction. Real World Planning. Planning with Time. Time 15/11/2012. COMP219: Artificial Intelligence. COMP219: Artificial Intelligence
COMP219: Artificial Intelligence COMP219: Artificial Intelligence Dr. Annabel Latham Room 2.05 Ashton Building Department of Computer Science University of Liverpool Lecture 26: Real World Planning: Scheduling
More informationEfficient 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
More informationPLAANN as a Classification Tool for Customer Intelligence in Banking
PLAANN as a Classification Tool for Customer Intelligence in Banking EUNITE World Competition in domain of Intelligent Technologies The Research Report Ireneusz Czarnowski and Piotr Jedrzejowicz Department
More information