We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byMadyson Whitley
Modified over 2 years ago
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
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.
Genetic Algorithms for multiple resource constraints Production Scheduling with multiple levels of product structure By : Pupong Pongcharoen (Ph.D. Research.
Using Simulated Annealing and Evolution Strategy scheduling capital products with complex product structure By: Dongping SONG Supervisors: Dr. Chris Hicks.
© C.Hicks, University of Newcastle IGLS02/1 A Genetic Algorithm Tool for Designing Manufacturing Facilities in the Capital Goods Industry Dr Christian.
© C.Hicks, University of Newcastle IGLS04/1 Determining optimum Genetic Algorithm parameters for designing manufacturing facilities in the capital goods.
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
© 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.
1 Short Term Scheduling. 2 Planning horizon is short Multiple unique jobs (tasks) with varying processing times and due dates Multiple unique jobs.
Geraint Palmer Optimisation using Linear Programming.
ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Algorithm Design Methods Spring 2007 CSE, POSTECH.
1 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.
Task Assignment and Transaction Clustering Heuristics.
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.
© 2017 SlidePlayer.com Inc. All rights reserved.