Planning and Scheduling in Supply Chains: an Overview of Issues in Practice

Total Page:16

File Type:pdf, Size:1020Kb

Planning and Scheduling in Supply Chains: an Overview of Issues in Practice PRODUCTION AND OPERATIONS MANAGEMENT POMS Vol. 13, No. 1, Spring 2004, pp. 77–92 issn 1059-1478 ͉ 04 ͉ 1301 ͉ 077$1.25 © 2004 Production and Operations Management Society Planning and Scheduling in Supply Chains: An Overview of Issues in Practice Stephan Kreipl • Michael Pinedo SAP Germany AG & Co.KG, Neurottstrasse 15a, 69190 Walldorf, Germany Stern School of Business, New York University, 40 West Fourth Street, New York, New York 10012 his paper gives an overview of the theory and practice of planning and scheduling in supply chains. TIt first gives an overview of the various planning and scheduling models that have been studied in the literature, including lot sizing models and machine scheduling models. It subsequently categorizes the various industrial sectors in which planning and scheduling in the supply chains are important; these industries include continuous manufacturing as well as discrete manufacturing. We then describe how planning and scheduling models can be used in the design and the development of decision support systems for planning and scheduling in supply chains and discuss in detail the implementation of such a system at the Carlsberg A/S beerbrewer in Denmark. We conclude with a discussion on the current trends in the design and the implementation of planning and scheduling systems in practice. Key words: planning; scheduling; supply chain management; enterprise resource planning (ERP) sys- tems; multi-echelon inventory control Submissions and Acceptance: Received October 2002; revisions received April 2003; accepted July 2003. 1. Introduction taking into account inventory holding costs and trans- This paper focuses on models and solution ap- portation costs. A planning model may make a dis- proaches for planning and scheduling in supply tinction between different product families, but usu- chains. It describes several classes of planning and ally does not make a distinction between different scheduling models that are currently being used in products within a family. It may determine the opti- systems that optimize supply chains. It discusses the mal run length (or, equivalently, batch size or lot size) architecture of decision support systems that have of a given product family when a decision has been been implemented in industry and the problems that made to produce such a family at a given facility. If there are multiple families produced at the same fa- have come up in the implementation and integration cility, then there may be setup costs and setup times. of systems in supply chains. In the implementations The optimal run length of a product family is a considered, the total cost in the supply chain has to be function of the trade-off between the setup cost minimized, i.e., the stages in the supply chain do not and/or setup time and the inventory carrying cost. compete in any form with one another, but collaborate The main objectives in medium term planning in- in order to minimize total costs. This paper focuses volve inventory carrying costs, transportation costs, primarily on how to integrate medium term planning tardiness costs, and the major setup costs. However, models (e.g., lot sizing models) and detailed schedul- in a medium term planning model, it is typically not ing models (e.g., job shop scheduling models) into a customary to take the sequence dependency of single framework. setup times and setup costs into account. The se- A medium term production planning model typi- quence dependency of setups is difficult to incorpo- cally optimizes several consecutive stages in a supply rate in an integer programming formulation and can chain (i.e., a multi-echelon model), with each stage increase the complexity of the formulation signifi- having one or more facilities. Such a model is de- cantly. signed to allocate the production of the different prod- A short term detailed scheduling model is typically ucts to the various facilities in each time period, while only concerned with a single facility, or, at most, with 77 Kreipl and Pinedo: Planning and Scheduling in Supply Chains 78 Production and Operations Management 13(1), pp. 77–92, © 2004 Production and Operations Management Society a single stage. Such a model usually takes more de- There is an extensive literature on supply chain tailed information into account than a planning management. Many papers and books focus on sup- model. It is typically assumed that there are a given ply chain coordination; a significant amount of this number of jobs and each one has its own parameters work has an emphasis on inventory control, pricing (including sequence-dependent setup times and se- issues, and the value of information; see Simchi-Levi, quence-dependent setup costs). The jobs have to be Kaminsky, and Simchi-Levi (2000), Chopra and scheduled in such a way that one or more objectives Meindl (2001), and Stadtler and Kilger (2000). There is are minimized, e.g., the number of jobs that are also an extensive literature on production planning shipped late, the total setup time, and so on. and scheduling theory. A significant amount of re- Clearly, planning models differ from scheduling search has been done on the solution methods appli- models in a number of ways. First, planning models cable to planning and scheduling models; see Shapiro often cover multiple stages and optimize over a medium (2001). Planning models and scheduling models have term horizon, whereas scheduling models are usually often been studied independently from one another in designed for a single stage (or facility) and optimize over order to obtain elegant theoretical results. Planning a short term horizon. Second, planning models use more models are often based on (multi-echelon) inventory aggregate information, whereas scheduling models use theory and lot sizing; see Zipkin (2000), Kimms (1997), more detailed information. Third, the objective to be Drexl and Kimms (1997), Muckstadt and Roundy minimized in a planning model is typically a total cost (1993), and Dobson (1987, 1992). Scheduling models objective and the unit in which this is measured is a typically focus on how to schedule a number of jobs in monetary unit; the objective to be minimized in a sched- a given machine environment in order to minimize uling model is typically a function of the completion some objective. For general treatises on scheduling, times of the jobs and the unit in which this is measured see Bhaskaran and Pinedo (1992), Brucker (1998), is often a time unit. Nevertheless, even though there are Pinedo (2002), and Pinedo and Chao (1999). For appli- fundamental differences between these two types of cations of scheduling to supply chain management, models, they often have to be incorporated into a single see Hall and Potts (2000) and Lourenco (2001). Some framework, share information, and interact extensively research has been done on more integrated models in with one another. the form of hierarchical planning systems; this re- Planning and scheduling models may also interact search has resulted in frameworks that incorporate with other types of models, such as long term strategic planning and scheduling; see Bowersox and Closs models, facility location models, demand manage- (1996), Barbarosoglu and Ozgur (1999), Dhaenens- ment models, and forecasting models; these models Flipo and Finke (2001), Shapiro (2001), and Miller are not discussed in this paper. The interactions with (2002). For examples of descriptions of successful in- these other types of models tend to be less intensive dustrial implementations, see Haq (1991), Arntzen, and less interactive. In what follows, we assume that the Brown, Harrison, and Trafton (1995), Hadavi (1998), physical settings in the supply chain have already been and Shepherd and Lapide (1998). established; the configuration of the chain is given, and This paper is organized as follows. The second section the number of facilities at each stage is known. describes and categorizes some of the typical industrial Supply chains in the various industries are often not settings. The third section discusses the overall frame- very similar and may actually give rise to different works in which planning models as well as scheduling sets of issues and problems. This paper considers ap- models have to be embedded. The fourth section de- plications of planning and scheduling models in sup- scribes a standard mixed integer programming formu- ply chains in various industry sectors. A distinction is lation of a planning model for a supply chain. The fifth made between two types of industries, namely the section covers a typical formulation of a scheduling continuous manufacturing industries (which include problem in a facility in a supply chain. The sixth section the process industries) and the discrete manufacturing describes an actual implementation of a planning and industries (which include, for example, automotive scheduling software system at the Danish beerbrewer and consumer electronics). Each one of these two main Carlsberg A/S. The last section presents the conclusions categories is subdivided into several subcategories. and discusses the impact of the Internet on decision This categorization is used because of the fact that the support systems in supply chains. planning and scheduling procedures in the two main categories tend to be different. We focus on the frame- works in which the planning and scheduling models 2. Supply Chain Settings and have to be embedded; we describe the type of infor- Configurations mation that has to be transferred back and forth be- This section gives a concise overview of the various tween the modules and the kinds of optimization that types of supply chains. It describes the differences in is done within the modules. the characteristics and the parameters of the various Kreipl and Pinedo: Planning and Scheduling in Supply Chains Production and Operations Management 13(1), pp. 77–92, © 2004 Production and Operations Management Society 79 categories. It first describes the various different in- single machine and parallel machine scheduling mod- dustry groups and their supply chain characteristics els.
Recommended publications
  • Division 01 – General Requirements Section 01 32 16 – Construction Progress Schedule
    DIVISION 01 – GENERAL REQUIREMENTS SECTION 01 32 16 – CONSTRUCTION PROGRESS SCHEDULE DIVISION 01 – GENERAL REQUIREMENTS SECTION 01 32 16 – CONSTRUCTION PROGRESS SCHEDULE PART 1 – GENERAL 1.01 SECTION INCLUDES A. This Section includes administrative and procedural requirements for the preparation, submittal, and maintenance of the progress schedule, reporting progress of the Work, and Contract Time adjustments, including the following: 1. Format. 2. Content. 3. Revisions to schedules. 4. Submittals. 5. Distribution. B. Refer to the General Conditions and the Agreement for definitions and specific dates of Contract Time. C. The above listed Project schedules shall be used for evaluating all issues related to time for this Contract. The Project schedules shall be updated in accordance with the requirements of this Section to reflect the actual progress of the Work and the Contractor’s current plan for the timely completion of the Work. The Project schedules shall be used by the Owner and Contractor for the following purposes as well as any other purpose where the issue of time is relevant: 1. To communicate to the Owner the Contractor’s current plan for carrying out the Work; 2. To identify work paths that is critical to the timely completion of the Work; 3. To identify upcoming activities on the Critical Path(s); 4. To evaluate the best course of action for mitigating the impact of unforeseen events; 5. As the basis for analyzing the time impact of changes in the Work; 6. As a reference in determining the cost associated with increases or decreases in the Work; 7. To identify when submittals will be submitted; 8.
    [Show full text]
  • Production Planning in Different Stages of a Manufacturing Supply Chain Under Multiple Uncertainties Goutham Ramaraj Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 Production planning in different stages of a manufacturing supply chain under multiple uncertainties Goutham Ramaraj Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Industrial Engineering Commons, and the Operational Research Commons Recommended Citation Ramaraj, Goutham, "Production planning in different stages of a manufacturing supply chain under multiple uncertainties" (2017). Graduate Theses and Dissertations. 16108. https://lib.dr.iastate.edu/etd/16108 This Thesis is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Production planning in different stages of a manufacturing supply chain under multiple uncertainties by Goutham Ramaraj A thesis submitted to the graduate faculty in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Major: Industrial Engineering Program of Study Committee: Guiping Hu, Major Professor Lizhi Wang Stephen Vardeman The student author and the program of study committee are solely responsible for the content of this thesis. The Graduate College will ensure this thesis is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright © Goutham Ramaraj, 2017. All rights reserved. ii DEDICATION To my family for their unconditional support. iii TABLE OF CONTENTS Page ACKNOWLEDGMENTS ......................................................................................... v ABSTRACT………………………………. .............................................................. vi CHAPTER 1 GENERAL INTRODUCTION ......................................................
    [Show full text]
  • By Philip I. Thomas
    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 Professor Heinz Schaettler Department of Electrical and Systems Engineering May 2013 Abstract An algorithm for weekly workforce scheduling with 4-hour discrete resolution that optimizes for employee satisfaction is formulated. Parameters of employee avail- ability, employee preference, required employees per shift, and employee weekly hours are considered in a binary integer programming model designed for auto- mated schedule generation. Contents Abstracti 1 Introduction and Background1 1.1 Background...............................1 1.2 Existing Models.............................2 1.3 Motivating Example..........................2 1.4 Problem Statement...........................3 2 Approach4 2.1 Proposed Model.............................4 2.2 Project Goals..............................4 2.3 Model Design..............................5 2.4 Implementation.............................6 2.5 Usage..................................6 3 Model8 3.0.1 Indices..............................8 3.0.2 Parameters...........................8 3.0.3 Decision Variable........................8 3.1 Constraints...............................9 3.2 Employee Shift Weighting.......................9 3.3 Objective Function........................... 11 4 Implementation and Results 12 4.1 Constraints............................... 12 4.2 Excel Implementation.........................
    [Show full text]
  • Improving Construction Workflow- the Role of Production Planning and Control
    Improving Construction Workflow- The Role of Production Planning and Control by Farook Ramiz Hamzeh MS (University of California at Berkeley) 2006 M Eng. (American University of Beirut) 2000 B Eng. (American University of Beirut) 1997 A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Engineering - Civil and Environmental Engineering in the GRADUATE DIVISION of the UNIVERSITY OF CALIFORNIA, BERKELEY Committee in charge: Professor Iris D. Tommelein (CEE), Chair Professor Glenn Ballard (CEE) Professor Phil Kaminsky (IEOR) Fall 2009 Improving Construction Workflow- The Role of Production Planning and Control Copyright 2009 by Farook Ramiz Hamzeh Abstract Improving Construction Workflow- The Role of Production Planning and Control by Farook Ramiz Hamzeh Doctor of Philosophy in Engineering - Civil and Environmental Engineering University of California, Berkeley Professor Iris D. Tommelein (CEE), Co-Chair, Professor Glenn Ballard (CEE), Co-Chair The Last PlannerTM System (LPS) has been implemented on construction projects to increase work flow reliability, a precondition for project performance against productivity and progress targets. The LPS encompasses four tiers of planning processes: master scheduling, phase scheduling, lookahead planning, and commitment / weekly work planning. This research highlights deficiencies in the current implementation of LPS including poor lookahead planning which results in poor linkage between weekly work plans and the master schedule. This poor linkage
    [Show full text]
  • Overview of Project Scheduling Following the Definition of Project Activities, the Activities Are Associated with Time to Create a Project Schedule
    Project Management Planning Development of a Project Schedule Initial Release 1.0 Date: January 1997 Overview of Project Scheduling Following the definition of project activities, the activities are associated with time to create a project schedule. The project schedule provides a graphical representation of predicted tasks, milestones, dependencies, resource requirements, task duration, and deadlines. The project’s master schedule interrelates all tasks on a common time scale. The project schedule should be detailed enough to show each WBS task to be performed, the name of the person responsible for completing the task, the start and end date of each task, and the expected duration of the task. Like the development of each of the project plan components, developing a schedule is an iterative process. Milestones may suggest additional tasks, tasks may require additional resources, and task completion may be measured by additional milestones. For large, complex projects, detailed sub-schedules may be required to show an adequate level of detail for each task. During the life of the project, actual progress is frequently compared with the original schedule. This allows for evaluation of development activities. The accuracy of the planning process can also be assessed. Basic efforts associated with developing a project schedule include the following: • Define the type of schedule • Define precise and measurable milestones • Estimate task duration • Define priorities • Define the critical path • Document assumptions • Identify risks • Review results Define the Type of Schedule The type of schedule associated with a project relates to the complexity of the implementation. For large, complex projects with a multitude of interrelated tasks, a PERT chart (or activity network) may be used.
    [Show full text]
  • Real-Time Scheduling (Part 1) (Working Draft)
    Real-Time Scheduling (Part 1) (Working Draft) Insup Lee Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania www.cis.upenn.edu/~lee/ CIS 541, Spring 2010 Real-Time System Example • Digital control systems – periodically performs the following job: senses the system status and actuates the system according to its current status Sensor Control-Law Computation Actuator Spring ‘10 CIS 541 2 Real-Time System Example • Multimedia applications – periodically performs the following job: reads, decompresses, and displays video and audio streams Multimedia Spring ‘10 CIS 541 3 Scheduling Framework Example Digital Controller Multimedia OS Scheduler CPU Spring ‘10 CIS 541 4 Fundamental Real-Time Issue • To specify the timing constraints of real-time systems • To achieve predictability on satisfying their timing constraints, possibly, with the existence of other real-time systems Spring ‘10 CIS 541 5 Real-Time Spectrum No RT Soft RT Hard RT Computer User Internet Cruise Tele Flight Electronic simulation interface video, audio control communication control engine Spring ‘10 CIS 541 6 Real-Time Workload . Job (unit of work) o a computation, a file read, a message transmission, etc . Attributes o Resources required to make progress o Timing parameters Absolute Released Execution time deadline Relative deadline Spring ‘10 CIS 541 7 Real-Time Task . Task : a sequence of similar jobs o Periodic task (p,e) Its jobs repeat regularly Period p = inter-release time (0 < p) Execution time e = maximum execution time (0 < e < p) Utilization U = e/p 0 5 10 15 Spring ‘10 CIS 541 8 Schedulability . Property indicating whether a real-time system (a set of real-time tasks) can meet their deadlines (4,1) (5,2) (7,2) Spring ‘10 CIS 541 9 Real-Time Scheduling .
    [Show full text]
  • Production Planning and Control of Closed-Loop Supply Chains
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Erasmus University Digital Repository Production planning and control of closed-loop supply chains Karl Inderfurth Otto-von-Guericke University Magdeburg, Faculty of Economics and Management, P.O.Box 4120, 39016 Magdeburg, Germany, [email protected] Ruud H. Teunter Erasmus University Rotterdam, Econometric Institute, P.O.Box 1738, 3000 DR Rotterdam, The Netherland, [email protected] Econometric Institute Report EI 2001 - 39 1. Introduction Closed-loop supply chains are characterized by the recovery of returned products. In most of these chains (e.g. glass, metal, paper, computers, copiers), used products (also known as cores) are returned by or collected from customers. But returned products can also come from production facilities within the supply chain (production defectives, by-products. In cases with internal returns, recovery is often referred to as rework. There are two main types of recovery: remanufacturing (product/part recovery) and recycling (material recovery). Energy recovery via incineration could be considered as a third type. Combinations of different recovery types are also possible. It is often not easy to decide what the best product recovery strategy is. Moreover, for a number of reasons, it is difficult to plan and control operations in closed-loop supply chains. Based on a literature review, [Guide 2000] lists the following complicating characteristics for planning and controlling a supply chain with remanufacturing of external returns: 1. The requirement for a reverse logistics network 2. The uncertain timing and quality of cores 3. The disassembly of cores 4.
    [Show full text]
  • Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems
    CME130 Surveillance Implications of Manufacturing and Subcontractor Management Module 2 Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems Content Student Notes 1. Production, Planning and Control (PPC) Systems. This module covers: • An introduction to Production, Planning and Control. • Guidelines on Sales and Operations Planning (S&OP) and Aggregate Planning. • Definition of Demand Management and three types of demand forecast techniques. • How Master Production Scheduling (MPS) is tracked and measured. • An introduction in using the Materials Requirements Planning (MRP) to identify resource risks and mitigate impact on deliverables. 2. The video you are about to see is a narrative by Manufacturing Branch Chief of DCMA Quality Assurance, Mr. Jackson, discussing what Phase 1 of the course means for the students. 1 Defense Acquisition University Student Guide CME130 Surveillance Implications of Manufacturing and Subcontractor Management Module 2 Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems Content Student Notes 3. Module 2’s Terminal Learning Objective Module 2 contains 5 lessons: • Lesson 1: Introduction to Production, Planning, and Control (PPC) • Lesson 2: Sales and Operations Planning (S&OP) and Aggregate Planning • Lesson 3: Demand Management • Lesson 4: Master Production Scheduling (MPS) • Lesson 5: Introduction to Materials Requirements Planning (MRP) 4. Lesson 1: Introduction to Production, Planning, and Control (PPC) Systems. 5. Lesson objectives. Upon completion of this lesson, you should be able to: • Contrast the role of PPC systems across strategic, tactical, and operational timeframes. • Describe PPC processes and activities across strategic, tactical, and operational timeframes.
    [Show full text]
  • Scheduling: Introduction
    7 Scheduling: Introduction By now low-level mechanisms of running processes (e.g., context switch- ing) should be clear; if they are not, go back a chapter or two, and read the description of how that stuff works again. However, we have yet to un- derstand the high-level policies that an OS scheduler employs. We will now do just that, presenting a series of scheduling policies (sometimes called disciplines) that various smart and hard-working people have de- veloped over the years. The origins of scheduling, in fact, predate computer systems; early approaches were taken from the field of operations management and ap- plied to computers. This reality should be no surprise: assembly lines and many other human endeavors also require scheduling, and many of the same concerns exist therein, including a laser-like desire for efficiency. And thus, our problem: THE CRUX: HOW TO DEVELOP SCHEDULING POLICY How should we develop a basic framework for thinking about scheduling policies? What are the key assumptions? What metrics are important? What basic approaches have been used in the earliest of com- puter systems? 7.1 Workload Assumptions Before getting into the range of possible policies, let us first make a number of simplifying assumptions about the processes running in the system, sometimes collectively called the workload. Determining the workload is a critical part of building policies, and the more you know about workload, the more fine-tuned your policy can be. The workload assumptions we make here are mostly unrealistic, but that is alright (for now), because we will relax them as we go, and even- tually develop what we will refer to as ..
    [Show full text]
  • The Applicability and Impact of Enterprise Resource Planning (ERP) Systems: Results from a Mixed Method Study on Make-To-Order (MTO) Companies
    The Applicability and Impact of Enterprise Resource Planning (ERP) Systems: Results from a Mixed Method Study on Make-To-Order (MTO) Companies * Bulut Aslan , Mark Stevenson, and Linda C. Hendry Name: Dr Bulut Aslan Institution: Istanbul Bilgi University Address: Department of Industrial Engineering Kazim Karabekir Cad. No: 2 34060, Eyup, Istanbul Turkey E-mail: [email protected] Tel: 00 90 212 3117440 Name: Dr Mark Stevenson Institution: Lancaster University Address: Department of Management Science Lancaster University Management School Lancaster University LA1 4YX U.K. Name: Professor Linda C Hendry Professor of Operations Management Institution: Lancaster University Address: Department of Management Science Lancaster University Management School Lancaster University LA1 4YX U.K. Keywords: Enterprise Resource Planning (ERP) systems; Make-To-Order (MTO); Mixed method study; Survey; Case study. * Corresponding Author: [email protected] The Applicability and Impact of Enterprise Resource Planning (ERP) Systems: Results from a Mixed Method Study on Make-To- Order (MTO) Companies Abstract The effect of a Make-To-Order (MTO) production strategy on the applicability and impact of Enterprise Resource Planning (ERP) systems is investigated through a mixed method approach comprised of an exploratory and explanatory survey followed by three case studies. Data on Make- To-Stock (MTS) companies is also collected as a basis for comparison. The exploratory data demonstrates, for example, that MTO adopters of ERP found the system selection process more difficult than MTS adopters. Meanwhile, a key reason why some MTO companies have not adopted ERP is that it is perceived as unsuitable. The explanatory data is used to test a series of hypotheses on the fit between decision support requirements, ERP functionality, and company performance.
    [Show full text]
  • Optimal Instruction Scheduling Using Integer Programming
    Optimal Instruction Scheduling Using Integer Programming Kent Wilken Jack Liu Mark He ernan Department of Electrical and Computer Engineering UniversityofCalifornia,Davis, CA 95616 fwilken,jjliu,[email protected] Abstract { This paper presents a new approach to 1.1 Lo cal Instruction Scheduling local instruction scheduling based on integer programming The lo cal instruction scheduling problem is to nd a min- that produces optimal instruction schedules in a reasonable imum length instruction schedule for a basic blo ck. This time, even for very large basic blocks. The new approach instruction scheduling problem b ecomes complicated (inter- rst uses a set of graph transformations to simplify the data- esting) for pip elined pro cessors b ecause of data hazards and dependency graph while preserving the optimality of the nal structural hazards [11 ]. A data hazard o ccurs when an in- schedule. The simpli edgraph results in a simpli ed integer struction i pro duces a result that is used bya following in- program which can be solved much faster. A new integer- struction j, and it is necessary to delay j's execution until programming formulation is then applied to the simpli ed i's result is available. A structural hazard o ccurs when a graph. Various techniques are used to simplify the formu- resource limitation causes an instruction's execution to b e lation, resulting in fewer integer-program variables, fewer delayed. integer-program constraints and fewer terms in some of the The complexity of lo cal instruction scheduling can de- remaining constraints, thus reducing integer-program solu- p end on the maximum data-hazard latency which occurs tion time.
    [Show full text]
  • QAD Dynasys: Demand & Supply Chain Planning (DSCP) Overview
    QAD DYNASYS DSCP DEMAND & SUPPLY CHAIN PLANNING Manufacturers and distributors continually strive to manage supply chain complexity and improve customer satisfaction while reducing inventory levels and costs. Effective supply chain planning solutions provide instant visibility and intuitive decision support, enabling companies to become more agile and exploit supply chain complexity. QAD DynaSys DSCP (demand and supply chain planning) provides a comprehensive end-to-end supply chain planning solution. It helps supply chain planning practitioners achieve the following business outcomes. • Anticipate. DSCP embeds best of breed, intuitive and demand driven material requirements planning business analytics that provide visibility across the (DDMRP). supply chain to ensure accurate decision making. • Simulate. DSCP synchronizes real-time with IoT to • Optimize. The solution uses advanced algorithmic alerts planners to events that may cause exceptions and machine learning forecasting and constraint- to the current plan. Planners are able run end-to- based optimization methods to quickly determine end simulations across the model to determine the best and most feasible plan. the most appropriate course of action using high • Plan. DSCP uses a single data model across performance in-memory computing. all facets of planning. This tightly synchronizes • Collaborate. There is an abundance of real- plans for manufacturing, distribution, inventory time intelligence in the minds of supply chain management and procurement. stakeholders that can add business value to • Respond. It is designed with the latest “response planning. DSCP is designed to harness the planning” techniques including demand sensing collective qualitative intelligence of all stakeholders. 1 of 4 DEMAND & SUPPLY CHAIN PLANNING VALUE AND BENEFITS QAD DynaSys DSCP customers benefit from a more accurate picture of their supply chain future.
    [Show full text]