Conceptual Models for Combined Planning and Scheduling Roman Barták Charles University, Prague

Slides:



Advertisements
Similar presentations
© Dr Evgeny Selensky, 2001 Motivation Hard industrially important problems Identify problem features making one technique better than the other Use domain.
Advertisements

1 Screen Shots. BOM Details Lot Sizing Constraints Alternate Items Produced Item Consumed Item Routing Used Consumption Ratio.
Constraint Satisfaction Problems Russell and Norvig: Parts of Chapter 5 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2004/home.htm Prof: Dekang.
Strategic Decisions (Part II)
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
On the Boundary of Planning and Scheduling: A Study Roman Barták Charles University, Prague
1 Inventory Control for Systems with Multiple Echelons.
Project management Project manager must;
1 John J. Conti Acting Director Office of Integrated Analysis and Forecasting Prepared for the Energy Technology System Analysis Program (ETSAP) Florence,
Transforming and Refining Abstract Constraint Specifications Alan Frisch, Brahim Hnich*, Ian Miguel, Barbara Smith, and Toby Walsh *Cork Constraint Computation.
Constraint Satisfaction Problems. Constraint satisfaction problems (CSPs) Standard search problem: – State is a “black box” – any data structure that.
System design-related Optimization problems Michela Milano Joint work DEIS Università di Bologna Dip. Ingegneria Università di Ferrara STI Università di.
ECE Synthesis & Verification1 ECE 667 Spring 2011 Synthesis and Verification of Digital Systems Verification Introduction.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
A Broad View Knowledge Engineering Competition Roman Barták Charles University, Prague What can we.
Chapter 1 and 2 Computer System and Operating System Overview
Modeling the Covering Test Problem Brahim Hnich, Steven Prestwich, and Evgeny Selensky Cork Constraint Computation Center UCC Supported by SFI.
Distributed Scheduling. What is Distributed Scheduling? Scheduling: –A resource allocation problem –Often very complex set of constraints –Tied directly.
Modelling 2 Aspects of Modelling. Treating certainty, uncertainty and risk – What if analysis – Sensitivity analysis – Scenario analysis Normative vs.
Using Use Case Scenarios and Operational Variables for Generating Test Objectives Javier J. Gutiérrez María José Escalona Manuel Mejías Arturo H. Torres.
Sequential circuit design
Solving Linear Programming Problems Using Excel Ken S. Li Southeastern Louisiana University.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
STRATEGIC MANAGEMENT ACCOUNTING Anushka De Silva.
CASE Tools And Their Effect On Software Quality Peter Geddis – pxg07u.
Chapter1 Software Economics.
Industrial Applications of Constraint Based Scheduling Helmut Simonis Parc Technologies Ltd IC-Parc, Imperial College London Helmut Simonis Parc Technologies.
Semantic Web Services Composition Peter Bartalos.
Planning and Scheduling Two Worlds in One System Roman Barták Charles University in Prague (Visopt B.V.)
1 ISE 195 Fundamentals of Industrial & Systems Engineering.
1 Design of Scheduling Systems Contents 1. Architecture of Scheduling Systems 2. Databases, Object Bases, Knowledge Bases 3. Schedule Generation 4. User.
I am Patrick Prosser I am a senior lecturer at Glasgow (and Strathclyde till mid April) I teach algorithms & data structures in java I am a member of.
1 Models of Computation o Turing Machines o Finite store + Tape o transition function: o If in state S1 and current cell is a 0 (1) then write 1 (0) and.
(Business) Process Centric Exchanges
Decision Diagrams for Sequencing and Scheduling Andre Augusto Cire Joint work with David Bergman, Willem-Jan van Hoeve, and John Hooker Tepper School of.
VIRTUAL MEMORY By Thi Nguyen. Motivation  In early time, the main memory was not large enough to store and execute complex program as higher level languages.
Chapter 1 Data Structures and Algorithms. Primary Goals Present commonly used data structures Present commonly used data structures Introduce the idea.
1 System Planning 2013 Lecture 7: Optimization Appendix A Contents: –General about optimization –Formulating optimization problems –Linear Programming.
Roman Barták Visopt B.V. (NL) / Charles University (CZ) IP&S in complex and dynamic areas Visopt Experience.
Constraints and Search Toby Walsh Cork Constraint Computation Centre (4C) Logic & AR Summer School, 2002.
Thread Level Parallelism Since ILP has inherent limitations, can we exploit multithreading? –a thread is defined as a separate process with its own instructions.
Chapter 2) CSP solving-An overview Overview of CSP solving techniques: problem reduction, search and solution synthesis Analyses of the characteristics.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
S UPPLY CHAIN MANAGEMENT B Y S HEETAL G AIKWAD. CONTENTS Introduction to supply chain Supply chain of WAL-MART Supply chain objective Supply chain management.
From Mind to Brain Machine The Architecture of Cognition David Davenport Computer Eng. Dept., Bilkent University, Ankara – Turkey.
Chapter 4: Linear Programming Lesson Plan Mixture Problems  Combining Resources to Maximize Profit Finding the Optimal Production Policy Why the Corner.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
DR. M.A. SANGELADJI CPA,CMA CALIFORNIA STATE UNIVERSITY NORTHRIDGE September 13,2003 WHAT IS ACCOUNTING?
Roman Barták (Charles University in Prague, Czech Republic) ACAT 2010.
Silberschatz and Galvin  Operating System Concepts Module 1: Introduction What is an operating system? Simple Batch Systems Multiprogramming.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Homework 1- Gateway.
Supply Chain Management
Schlenker, H. , R. Kluge, and J. Koehl
BUSINESS-TO-BUSINESS
Chapter 4: Linear Programming Lesson Plan
Dynamic Constraint Models for Complex Production Environments
Instructor: Rajeev Alur
The Transportation Model
Simple Circuit-Based SAT Solver
Foundations for Algebra
External Production Daniela Narváez Quality Control
Class #20 – Wednesday, November 5
at Glasgow (and Strathclyde till mid April)
Constraint satisfaction problems
Constraint satisfaction problems
Class #17 – Tuesday, October 30
Presentation transcript:

Conceptual Models for Combined Planning and Scheduling Roman Barták Charles University, Prague

© Roman Barták, 1999 Talk Schedule Problem area Mixed Planning & Scheduling Conceptual Models –why are they helpful? –time-line model –order-centric model –resource-centric model Comparison Future research

© Roman Barták, 1999 Problem area complex production environments –plastic, petrochemical, pharmaceutical industries several different resources –producers, movers, stores batch/serial processing time windows set-up times, transition patterns by-products, co-products cycling, re-cycling …

© Roman Barták, 1999 Problem area (continue) alternatives –processing formulas various raw material –production routes production for store (non-ordered) maximising profit (minimising cost) complex production environment Silo Sacks warehouse Processor B1 Processor B2 Silo Processor A purchase order

© Roman Barták, 1999 Mixed Planning and Scheduling planning = generate activities to satisfy the orders scheduling = allocate the activities to the resources over time what if appearance of the activity depends on the allocation of other activities? –set-ups & transition patterns –alternatives –non-ordered production MIXED PLANNING & SCHEDULING

© Roman Barták, 1999 Conceptual models CP = the user states the problem, the computer solves it we still do not reach this Holy Grail choice of a conceptual model => efficiency conceptual model captures –data structures (composition of variables) –composition of constraints What could be modelled? What is easy/hard to express?

© Roman Barták, 1999 Time-line model method of time slices duration = the greatest common divisor of activities’ duration description of situation at each time point store - the stored quantity for each item producer - the consumed and produced quantities; the state constraints –the resource constraints - capacity, compatibility –the transition constraints - set-ups –the supplier/consumer dependencies Production (item1)Change-overProduction (item 2)Production (item 3) Storing (item 1)emptyStoring (items 1&B) No productionProduction (item4)Production (item5) time resources empty

© Roman Barták, 1999 Representation (time-line model) a matrix (situation description x time) –too many unused variables initial and future situations –just set values of variables in given time-point (or bind them by the constraint) constraints –can be introduced before the scheduling starts GOOD PROPAGATION vs. TOO MANY VARIABLES

© Roman Barták, 1999 Order-centric model a chain of activities per order assigning resources to activities description of the activity –start, end (duration), resource constraints –the supplier/consumer dependencies (easy; timing only) –the resource constraints (hard; capacity, compatibility) –the transition constraints (extremely hard; set-ups) time resources Storing Processing B Storing Processing B Processing A

© Roman Barták, 1999 How to model? (in order-centric model) alternatives –pre-processing (a planner chooses the alternative in advance - before the scheduling) –virtual activities (slots filled by the activity) set-ups –virtual activities (slots filled by the activity) by-products –sharing activities between the production chains non-ordered production –pre-processing (non-ordered production is planned in advance - before the scheduling)

© Roman Barták, 1999 Resource-centric model a sequence of activities per resource “what the resource can process” rather then “how to satisfy the order” description of the activity –start, end (duration), quantities, state, suppliers, consumers constraints –the resource constraints (easy; capacity, compatibility) –the transition constraints (easy; set-ups) –the supplier/consumer dependencies (hard) Production (item1)Change-overProduction (item 2)Production (item 3) Storing (item 1)emptyStoring (items 1&B) No productionProduction (item4)Production (item5) time resources empty No orderOrder1No order

© Roman Barták, 1999 Representation (resource-centric model) a matrix (or lists of activities) –activity description x number of activities –virtual activities initial and futures situations –constraint the variables in given activities constraints –resource/transition constraints are introduced before the scheduling starts –supplier/consumer dependencies posted before scheduling (hard; more propagation?) posted during scheduling (easier)

© Roman Barták, 1999 Comparison of models

© Roman Barták, 1999 Where to use? Order-centric model –an order-driven production –a small number of alternatives –simple resource constraints Resource-centric model –complex resource constraints (transitions etc.) –a non-ordered production –alternatives Time-line model –a simple description of the resource –the model of store

© Roman Barták, 1999 What’s next? constraint model –a complete specification of the constraints (semi)-dynamic representation –constraints are posted during scheduling implementation –propagation (early detection of inconsistencies) –labelling (incremental) –heuristics (choice of alternatives)