• DocumentCode
    2183938
  • Title

    Simulation optimization for industrial scheduling using hybrid genetic representation

  • Author

    Andersson, Marcus ; Ng, Amos H C ; Grimm, Henrik

  • Author_Institution
    Centre for Intell. Autom., Univ. of Skovde, Skovde, Sweden
  • fYear
    2008
  • fDate
    7-10 Dec. 2008
  • Firstpage
    2004
  • Lastpage
    2011
  • Abstract
    Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operation plans to control the shop floor. In the literature, there are two major approaches for tackling the simulation-based scheduling problems, namely dispatching rules and using meta-heuristic search algorithms. The purpose of this paper is to illustrate that there are advantages when these two approaches are combined. More precisely, this paper introduces a novel hybrid genetic representation as a combination of both a partially completed schedule (direct) and the optimal dispatching rules (indirect), for setting the schedules for some critical stages (e.g. bottlenecks) and other non-critical stages respectively. When applied to an industrial case study, this hybrid method has been found to outperform the two common approaches, in terms of finding reasonably good solutions within a shorter time period for most of the complex scheduling scenarios.
  • Keywords
    genetic algorithms; job shop scheduling; search problems; simulation; complex real-world system; hybrid genetic representation; industrial scheduling; meta-heuristic search algorithm; optimal dispatching rule; shop floor; simulation optimization; Camshafts; Computational modeling; Dispatching; Flexible manufacturing systems; Genetics; Job shop scheduling; Machining; Optimal scheduling; Processor scheduling; Production;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Simulation Conference, 2008. WSC 2008. Winter
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-2707-9
  • Electronic_ISBN
    978-1-4244-2708-6
  • Type

    conf

  • DOI
    10.1109/WSC.2008.4736295
  • Filename
    4736295