Stochastic Models in Planning Complex Engineer-To-Order Products

Slides:



Advertisements
Similar presentations
Introduction to Transportation Systems. PART II: FREIGHT TRANSPORTATION.
Advertisements

IGLS/1 © P. Pongcharoen Using Genetic Algorithms for Scheduling the Production of Capital Goods P. Pongcharoen, C. Hicks, P.M. Braiden, A.V. Metcalfe,
Scheduling.
© C.Hicks, University of Newcastle IGLS04/1 Stochastic simulation of dispatching rules in the capital goods industry Dr Christian Hicks University of Newcastle.
Scheduling Chapter 19.
In this handout Stochastic Dynamic Programming
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Due Date Planning for Complex Product Systems with Uncertain Processing Times By: Dongping Song Supervisor: Dr. C.Hicks and Dr. C.F.Earl Dept. of MMM Eng.
© C.Hicks, University of Newcastle HIC288/1 A TOOL FOR OPTIMISING FACILITIES DESIGN FOR CAPITAL GOODS COMPANIES Christian Hicks
© C.Hicks, University of Newcastle IGLS02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods Industry Dr Christian.
ENBIS/1 © Chris Hicks University of Newcastle upon Tyne An analysis of the use of the Beta distribution for planning large complex projects Chris Hicks,
Rescheduling Manufacturing Systems: a framework of strategies, policies, and methods Vieira, Herrmann and Lin.
Chapter 2: Model of scheduling problem Components of any model: Decision variables –What we can change to optimize the system, i.e., model output Parameters.
Genetic Algorithms for multiple resource constraints Production Scheduling with multiple levels of product structure By : Pupong Pongcharoen (Ph.D. Research.
Job Release-Time Design in Stochastic Manufacturing Systems Using Perturbation Analysis By: Dongping Song Supervisors: Dr. C.Hicks & Dr. C.F.Earl Department.
Decision Making as a Component of Problem Solving
Components and Organization of Discrete-event Simulation Model
© C.Hicks, University of Newcastle KNOW99/1 Knowledge Management in Capital Goods Companies Dr. Christian Hicks University of Newcastle upon Tyne.
© C.Hicks, University of Newcastle Manufacturing Systems Research Chris Hicks.
© C.Hicks / P.M.Braiden EDIN/1 Knowledge Management: An Engineering Perspective Dr. Christian Hicks Professor Paul Braiden University of Newcastle upon.
presented by Zümbül Bulut
Two stage group screening with noise factors, unequal group sizes and differing probabilities of active effects Anna Vine University of Southampton, UK.
SIMULATION EXAMPLES. SELECTED SIMULATION EXAMPLES 4 Queuing systems (Dynamic System) 4 Inventory systems (Dynamic and Static) 4 Monte-Carlo simulation.
PG Conf /1 © F.A. Hossen, M&S Engineering University of Newcastle upon Tyne Managing Project Planning Risk Fouzi A. Hossen.
© C.Hicks, University of Newcastle IGLS06/1 Laissez-faire or full control? An evaluation of various control strategies for companies that produce complex.
ENBIS/1 © Chris Hicks University of Newcastle upon Tyne Stochastic simulation studies of dispatching rules for production scheduling in the capital goods.
© C.Hicks, University of Newcastle HICKS/1 Research Overview Christian Hicks
Due Date Planning for Complex Product Systems with Uncertain Processing Times By: D.P. Song, C.Hicks and C.F.Earl Dept. of MMM Eng. Univ. of Newcastle.
© C.Hicks, University of Newcastle C.F.Earl, Open University IDMME02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
© C.Hicks, University of Newcastle ASAC06/1 Establishing the relationship between mean tardiness and the number of resources under close control for companies.
Due Date Planning for Complex Product Systems with Uncertain Processing Times By: Dongping Song Supervisors: Dr. C.Hicks & Dr. C.F.Earl Department of MMM.
© C.Hicks, University of Newcastle WAR/1 Knowledge Management in Capital Goods Companies Dr. Christian Hicks University of Newcastle upon Tyne.
Using Simulated Annealing and Evolution Strategy scheduling capital products with complex product structure By: Dongping SONG Supervisors: Dr. Chris Hicks.
1 IOE/MFG 543 Chapter 10: Single machine stochastic models Sections 10.1 and 10.4 You may skip Sections
CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.
Maintenance Forecasting and Capacity Planning
Chapter 14 Simulation. 2 What Is Simulation?  Simulation: A model of a complex system and the experimental manipulation of the model to observe the results.
Operations Research Models
Scheduling.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
CRESCENDO Full virtuality in design and product development within the extended enterprise Naples, 28 Nov
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
CPSC 422, Lecture 9Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 9 Sep, 28, 2015.
An Adaptive-Stochastic Boussinesq Solver With Safety Critical Applications In Nuclear Reactor Engineering Andrew Hagues PhD Student – KNOO Work Package.
Chapter 7 PERT Project Management for Business, Engineering, and Technology.
Optimal Resource Allocation for Protecting System Availability against Random Cyber Attack International Conference Computer Research and Development(ICCRD),
Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.
Lecture 4: Software Process Management Dr Valentina Plekhanova University of Sunderland, UK
Xiao Liu 1, Yun Yang 1, Jinjun Chen 1, Qing Wang 2, and Mingshu Li 2 1 Centre for Complex Software Systems and Services Swinburne University of Technology.
1 S ystems Analysis Laboratory Helsinki University of Technology Manuscript “On the Use of Influence Diagrams in a One-on-One Air Combat Game” in Kai Virtanen’s.
Lab for Remote Sensing Hydrology and Spatial Modeling Dept of Bioenvironmental Systems Engineering National Taiwan University 1/45 GEOSTATISTICS INTRODUCTION.
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.
Infinite loading A scheduling approach that ignores capacity constraints. Click here for Hint finite loading or infinite loading or priority rule?
assemble-to-order (ATO) A system that produces standard modules to be
2016 International Conference on Grey Systems and Uncertainty Analysis
Chap 11 Learning Objectives
Dept. of MMME, University of Newcastle upon Tyne
Dept. of MMME, University of Newcastle upon Tyne
Introduction to Scheduling Chapter 1
8 Job Sequencing & Operations Scheduling CHAPTER Arranged by
Dept. of MMME, University of Newcastle upon Tyne
Manufacturing Planning and Control
Presentation transcript:

Stochastic Models in Planning Complex Engineer-To-Order Products By: Dong-Ping Song Supervisors: Dr. Chris Hicks, Prof. Chris F. Earl Department of Mechanical, Materials and Manufacturing Engineering, University of Newcastle upon Tyne, UK, Oct. 2001

Objectives of Thesis Developing a series of effective methods for the planning of ETO manufacturing systems producing products with complex product structure and various uncertainties.

Engineer-To-Order System ETO – products are engineered and produced based on the specifications of the customer. Order tendering and engineering design are included. Characteristics – highly customised; low volume; complex product structure; uncertainties; two major stages.

Work-flow and Planning Levels of an ETO System

Special Issues in ETO Planning Product due date planning (-- level 1) Stage due date and activity start times planning (-- level 2) Production scheduling (-- level 3) Dynamic production scheduling (-- level 3)

Structure of Thesis Ch 1 & Ch 2 Ch 3 Ch 4 & Ch 5 Ch 6 Ch 7 Ch 9 Ch 8 high Ch 3 Product due date planning Ch 4 & Ch 5 Stage due date planning Activity start times planning Planning level Ch 6 Ch 7 Production scheduling Dynamic scheduling Ch 9 Ch 8 low Ch 10

Key Assumptions Probability distribution of operation processing times are available Products have specified structures of manufacturing and assembly operations

Product Due Date Planning Objective – find a better product due date using the information on processing time distributions of operations in a multistage product structure. Method – moment-based approximation. Possible application – quote reliable delivery date at order tendering stage.

Stage Due Date and Activity Start Time Planning Objective – planning due dates at each stage to meet specified service targets. Method – recursive procedure with moment-based approximation. Objective – planning activity start times with given product due date to minimise expected earliness and tardiness cost. Method – Perturbation Analysis Stochastic Approximation (PASA). Possible application – set good start and due dates for each stage in multistage assembly systems by taking into account the effects of uncertainty.

Production Scheduling In stochastic systems, a schedule must be capable of dealing with the situation, “when a resource finishes one operation, the next scheduled operation has not arrived but several other operations are queuing at this resource; which operation should the resource do next?” Choice I – Keeping original schedule  scheduling problem I Choice II – Applying a priority rule  scheduling problem II

Two Type Scheduling Problems Type-I scheduling problem – find optimal sequences and timings by minimising expected total earliness and tardiness cost, where the current operation sequence is followed when determining the cost of a particular candidate schedule during optimisation. Type- II scheduling problem – find the optimal operation timings directly by minimising expected total earliness and tardiness cost, where the operation sequences are unknown in advance due to uncertainty of operation durations (a priority rule is used).

Two-phase optimisation method to solve type-I scheduling problem

One-phase optimisation method to solve type-II scheduling problem Sn – a schedule. EPST – earliest planned start time

Production Scheduling – applicable situations Deterministic scheduling problems – using Heuristic, Simulated Annealing, Evolution Strategy methods in Ch 6. Stochastic timing scheduling with fixed sequences – using PASA, Simulated Annealing, Evolution Strategy methods in Ch 7. Type-I scheduling in stochastic situation – using two-phase optimisation method in Ch 8 based on Ch 6 and 7. Type-II scheduling in stochastic situation – using one-phase optimisation method in Ch 8.

Dynamic Production Scheduling Incremental planning – generate an incremental plan for the new order without affecting the production schedule for the existing orders. Regenerative planning – regenerate a plan for the new order and those unfinished existing orders. Assumption – deterministic operation times.

Dynamic Scheduling – methods Incremental Planning Regenerative Planning Forward incremental planning Backward incremental planning Evolution Strategy incremental planning Forward regenerative planning Evolution Strategy regenerative planning

Conclusions Developed a series of effective methods for the planning of stochastic ETO products. Investigated the effects of complex product structure and uncertainty in processing times. Examined the effects of dynamic arriving orders. Addressed specific planning problems such as product due date planning, stage due date and activity start time planning, production scheduling, dynamic incremental planning and rescheduling.

Limitations Distribution of processing times are required. Random variables in Ch 3~5 are assumed to be independent. Process planning is not considered and product structure is pre-specified. Set-up and transfer times are not explicitly considered.