IGLS/1 © P. Pongcharoen Using Genetic Algorithms for Scheduling the Production of Capital Goods P. Pongcharoen, C. Hicks, P.M. Braiden, A.V. Metcalfe,

Slides:

Advertisements

Similar presentations

Fakultät für informatik informatik 12 technische universität dortmund Standard Optimization Techniques Peter Marwedel Informatik 12 TU Dortmund Germany.

Advertisements

QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.

Algorithm Design Methods Spring 2007 CSE, POSTECH.

G5BAIM Artificial Intelligence Methods

Problems and Their Classes

S YSTEM -W IDE E NERGY M ANAGEMENT FOR R EAL -T IME T ASKS : L OWER B OUND AND A PPROXIMATION Xiliang Zhong and Cheng-Zhong Xu ICCAD 2006, ACM Trans. on.

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.

1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.

ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.

Progress in Linear Programming Based Branch-and-Bound Algorithms

All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.

CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier

1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.

© 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.

1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.

Genetic Algorithms for multiple resource constraints Production Scheduling with multiple levels of product structure By : Pupong Pongcharoen (Ph.D. Research.

Task Assignment and Transaction Clustering Heuristics.

© C.Hicks, University of Newcastle Manufacturing Systems Research Chris Hicks.

1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.

A Comparative Study Of Deterministic And Stochastic Optimization Methods For Integrated Design Of Processes Mario Francisco a, Silvana Revollar b, Pastora.

1 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.

© C.Hicks, University of Newcastle IGLS06/1 Laissez-faire or full control? An evaluation of various control strategies for companies that produce complex.

Ant Colony Optimization Optimisation Methods. Overview.

Review Best-first search uses an evaluation function f(n) to select the next node for expansion. Greedy best-first search uses f(n) = h(n). Greedy best.

Simulated Annealing Van Laarhoven, Aarts Version 1, October 2000.

© 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,

D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.

1 Contents college 3 en 4 Book: Appendix A.1, A.3, A.4, §3.4, §3.5, §4.1, §4.2, §4.4, §4.6 (not: §3.6 - §3.8, §4.2 - §4.3) Extra literature on resource.

© C.Hicks, University of Newcastle IGLS04/1 Determining optimum Genetic Algorithm parameters for designing manufacturing facilities in the capital goods.

Using Simulated Annealing and Evolution Strategy scheduling capital products with complex product structure By: Dongping SONG Supervisors: Dr. Chris Hicks.

Scheduling Parallel Task

By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.

Elements of the Heuristic Approach

Metaheuristics Meta- Greek word for upper level methods

Scheduling and Scheduling Philosophies By Nilesh Sivaramakrishnan For IEM 5303.

Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.

Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.

1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.

Simulated Annealing.

Fuzzy Genetic Algorithm

Doshisha Univ., Kyoto, Japan CEC2003 Adaptive Temperature Schedule Determined by Genetic Algorithm for Parallel Simulated Annealing Doshisha University,

1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.

Mathematical Models & Optimization?

Exact and heuristics algorithms

Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.

Operations Research The OR Process. What is OR? It is a Process It assists Decision Makers It has a set of Tools It is applicable in many Situations.

Optimization Problems

© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.

Product A Product B Product C A1A1 A2A2 A3A3 B1B1 B2B2 B3B3 B4B4 C1C1 C3C3 C4C4 Turret lathes Vertical mills Center lathes Drills From “Fundamentals of.

Geraint Palmer Optimisation using Linear Programming.

Optimization Problems

Some Topics in OR.

Van Laarhoven, Aarts Version 1, October 2000

Digital Optimization Martynas Vaidelys.

CHAPTER 8 Operations Scheduling

General Purpose Procedures Applied to Scheduling

Optimization Problems

CSE 589 Applied Algorithms Spring 1999

Dept. of MMME, University of Newcastle upon Tyne

Dept. of MMME, University of Newcastle upon Tyne

Planning and Scheduling in Manufacturing and Services

Topic 15 Job Shop Scheduling.

IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.

Dept. of MMME, University of Newcastle upon Tyne

Md. Tanveer Anwar University of Arkansas

Presentation transcript:

IGLS/1 © P. Pongcharoen Using Genetic Algorithms for Scheduling the Production of Capital Goods P. Pongcharoen, C. Hicks, P.M. Braiden, A.V. Metcalfe, D.J. Stewardson University of Newcastle upon Tyne

IGLS/2 © P. Pongcharoen Scheduling The allocation of resources over time to perform a collection of tasks (Baker 1974) Scheduling problems in their static and deterministic forms are extremely simple to describe and formulate, but are difficult to solve (King and Spakis 1980)

IGLS/3 © P. Pongcharoen Scheduling Problems Involve complex combinatorial optimisation For n jobs on m machines there are potentially (n!) m sequences, e.g. n=10 m=3 => 1.7 million sequences. Most problems can only be solved by inefficient non-deterministic polynomial (NP) algorithms. Even a computer can take large amounts of time to solve only moderately large problems

IGLS/4 © P. Pongcharoen Scheduling the Production of Capital Goods Deep and complex product structures Long routings with many types of machine and process Multiple constraints such as assembly, precedence operation and resource constraints.

IGLS/5 © P. Pongcharoen Conventional Optimisation Algorithms Integer Linear Programming Dynamic Programming Branch and Bound These methods rely on enumerative search and are therefore only suitable for small problems

IGLS/6 © P. Pongcharoen More Recent Approaches Simulated Annealing Taboo Search Genetic Algorithms Characteristics Stochastic search. Suitable for combinatorial optimisation problems. Due to combinatorial explosion, they may not search the whole problem space. Thus, an optimal solution is not guaranteed.

IGLS/7 © P. Pongcharoen Melting substance Too fast cooling Heating up Slowly cooling Simulated Annealing Substance Equilibrium state with resulting crystal Out of equilibrium state with resulting defecting crystal

IGLS/8 © P. Pongcharoen Taboo Search

IGLS/9 © P. Pongcharoen Evaluation criteria Determination coefficient (R 2 ) Adjusted determination coefficient (R a 2 ) Mean square error (MS E ) Mallows statistic (C p )

IGLS/10 © P. Pongcharoen Conclusion (1) BGA has been developed for the scheduling of complex products with deep product structure and multiple resource constraints. Within a given execution time, large population (fewer generations) produced lower penalty costs and spread than small populations (many generations).

IGLS/11 © P. Pongcharoen Conclusion (2) BGA produced lower penalty costs than corresponding plans produced by using simulation.

IGLS/12 © P. Pongcharoen Any questions Please