Dynamic Constraint Models for Complex Production Environments

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.
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
Planning with Linear Programming
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 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Planning II GraphPlan and Russell and Norvig: ch.12 CMSC421 – Fall 2006 based on material from Jim Blythe, JC Latombe, Marie desJardins and Daphne Koller.
Knowledge and Systems Research Group, University of Huddersfield B vs OCL: Comparing Specification Languages for Planning Domains Diane Kitchin, Lee McCluskey,
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
An overview of design and operational issues of kanban systems M. S. AKTÜRK and F. ERHUN Presented by: Y. Levent KOÇAĞA.
Supply Chain Operations: Making and Delivering
Schedule Maker Language Sinan Xiao Green Zhang Liang Zhang Zhemin Zhang.
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.
Process Planning and Computer Aided Process Planning
Basic File Structures and Hashing Lectured by, Jesmin Akhter, Assistant professor, IIT, JU.
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.
CP Summer School Modelling for Constraint Programming Barbara Smith 1.Definitions, Viewpoints, Constraints 2.Implied Constraints, Optimization,
Applications of Evolutionary Algorithms Michael J. Watts
Microprocessor-based systems Curse 7 Memory hierarchies.
Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs Pavel Surynek presented by Filip Dvořák Faculty of Mathematics.
Slide 1 Mixed Model Production lines  2000 C.S.Kanagaraj Mixed Model Production Lines C.S.Kanagaraj ( Kana + Garage ) IEM 5303.
Production Planning and Detailed Scheduling (PP/DS) in SCM EGN 5623 Enterprise Systems Optimization (Professional MSEM) Fall, 2011.
1 Andreea Chis under the guidance of Frédéric Desprez and Eddy Caron Scheduling for a Climate Forecast Application ANR-05-CIGC-11.
Introduction Object oriented design is a method where developers think in terms of objects instead of procedures or functions. SA/SD approach is based.
Roman Barták Visopt B.V. (NL) / Charles University (CZ) IP&S in complex and dynamic areas Visopt Experience.
Copyright ©2004 Virtusa Corporation | CONFIDENTIAL Requirement Engineering Virtusa Training Group 2004 Trainer: Ojitha Kumanayaka Duration : 1 hour.
From Mind to Brain Machine The Architecture of Cognition David Davenport Computer Eng. Dept., Bilkent University, Ankara – Turkey.
1 CMSC 471 Fall 2004 Class #21 – Thursday, November 11.
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
Conceptual Models for Combined Planning and Scheduling Roman Barták Charles University, Prague
Roman Barták (Charles University in Prague, Czech Republic) ACAT 2010.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
CHAPTER 14 COST ANALYSIS FOR PLANNING McGraw-Hill/Irwin©The McGraw-Hill Companies, Inc., 2002.
Advanced Data Structures Lecture 1
Jobshop scheduling.
Scheduling with Constraint Programming
Automatic Test Generation
Supply Chain Management
XML: Extensible Markup Language
Virtual memory.
View Integration and Implementation Compromises
BUSINESS-TO-BUSINESS
Cost Accounting and Reporting Systems
OSE801 Engineering System Identification Spring 2010
CHAPTER 5 TECHNICAL ANALYSIS.
Course Summary Organization: A process providing goods and services based on a set of inputs, including raw material, capital, labor and knowledge. The.
Clock Driven Scheduling
Knowledge Representation
A Test Bed for Manufacturing Planning and Scheduling Discussion of Design Principles Sept Claude Le Pape Director R&D Manufacturing Planning and.
CS222P: Principles of Data Management Notes #6 Index Overview and ISAM Tree Index Instructor: Chen Li.
Technical Data Management Items
External Production Daniela Narváez Quality Control
Course Contents: T1 Greedy Algorithm Divide & Conquer
Class #20 – Wednesday, November 5
MANUFACTURING SYSTEMS
Out-of-Order Execution Structures Optimizations
CS222/CS122C: Principles of Data Management Notes #6 Index Overview and ISAM Tree Index Instructor: Chen Li.
Artificial Intelligence
King Saud University College of Engineering IE – 462: “Industrial Information Systems” Fall – 2018 (1st Sem H) Introduction (Chapter 1) part.
Chapter 4: Simulation Designs
Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan
Set Up For Success : Reviewing Manufacturing Best Practices
Constraint based scheduling
Production Planning and Detailed Scheduling (PP/DS) in SCM EGN 5623 Enterprise Systems Optimization Fall, 2012.
SCM Master Data - 2 Master Data for Distribution & Production Processes EGN 5346 Logistics Engineering Fall, 2015.
Class #17 – Tuesday, October 30
Presentation transcript:

Dynamic Constraint Models for Complex Production Environments * 07/16/96 Dynamic Constraint Models for Complex Production Environments Roman Barták Charles University, Prague bartak@kti.mff.cuni.cz *

Talk Schedule Problem area Mixing Planning & Scheduling Conceptual Models discrete & event based time static vs. dynamic representation overview & comparison of models mixing models Future research

Problem area complex production environments plastic, petrochemical, chemical, pharmaceutical industries several different resources producers, movers, stores batch/serial processing with time windows transition patterns (set-up times) by-products, co-products (re-cycling) non-ordered production (for store) alternatives processing routes, production formulas, raw material

Problem area (cont’d) complex production environment Task preparing a schedule for a given time period (not minimising the makespan) objective maximising the profit (minimising the cost) silo order processor B1 purchase silo processor A processor B2 sacks warehouse order

Planning and Scheduling finding a sequence of activities transferring the initial world into a required state high-level view of the factory low resolution longer time period what and how to produce? AI & CP Scheduling allocating the activities to available resources over time respecting the constraints low-level view of the factory high resolution shorter time period how to produce in detail? OR & CP

Mixing Planning and Scheduling Problems too tighten plans (impossible to schedule) too free plans (less profitable schedule) backtrack from the scheduler to the planner what if appearance of the activity depends on the allocation of other activities? transition patterns (set-ups), alternatives, non-ordered production Solution a scheduler with planning capabilities generating activities during scheduling

Conceptual models High-level declarative model of the problem data structures (composition of variables) composition of constraints resource constraints (compatibility, capacity) transitions between activities (set-ups) supplier/consumer dependencies Expressiveness What could be modelled? (problem area) What is easy/hard to express? (constraints) Efficiency constraint propagation

Conceptual models (cont’d) View of time discrete (time slices with the same duration) event-based (activities) Representation

Time-line model discretising the time line into time slices activities change at the edge between successive time slices duration = the greatest common divisor of activities’ duration description of situation at each time point/slice Example: the store - the stored quantity for each item good for both planning and scheduling activities for given time point/slice are chosen during scheduling a matrix representation (description x time) static / dynamic / semi-dynamic contents of the cells easy capture of initial & future situations Production (item1) Change-over Production (item 2) Production (item 3) Storing (item 1) empty Storing (items 1&B) No production Production (item4) Production (item5) time resources Time slice

Order-centric model a chain of activities per order assigning resources to activities description of the activity start, end (duration), resource representation production chain = a list of (virtual) activities time resources storing extruding polymerizing slots … candidate activities

How to model? (in order-centric model) alternatives pre-processing (chosen by the planner) alternative activities in slots set-ups set-up slot is either empty or contains the set-up activity (depending on the allocation of the next activity) by-products (re-cycling) sharing activities between the production chains non-ordered production pre-processing (non-ordered production is planned in advance - before the scheduling)

Resource-centric model Activity based a sequence of activities per resource “what the resource can process” rather than “how to satisfy the order” description of the activity start, end (duration), quantities, state, suppliers, consumers representation a list of virtual activities transition constraints between successive activities Production (item1) Change-over Production (item 2) Production (item 3) Storing (item 1) empty Storing (items 1&B) No production Production (item4) Production (item5) time resources No order Order1

Comparison of models

Mixing the models Minimising drawbacks while preserving advantages of different models different task = different model the time-line model for planning the order-centric model for scheduling different resource = different model producer & mover - activities (resource-centric) store - time-line

What’s next? constraint model implementation expressiveness a complete specification of the constraints implementation propagation (early detection of inconsistencies) labelling (incremental) heuristics (choice of alternatives) expressiveness secondary resources traceability agent based scheduling