• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Business Administration
      • Department of Management
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Business Administration
      • Department of Management
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Climbing depth-bounded discrepancy search for solving hybrid flow shop problems

      Thumbnail
      View / Download
      338.2 Kb
      Author(s)
      Hmida, A. B.
      Huguet, M.-J.
      Lopez, P.
      Haouari, M.
      Date
      2007
      Source Title
      European Journal of Industrial Engineering
      Print ISSN
      1751-5254
      Electronic ISSN
      1751-5262
      Publisher
      Inderscience Publishers
      Volume
      1
      Issue
      2
      Pages
      223 - 240
      Language
      English
      Type
      Article
      Item Usage Stats
      163
      views
      192
      downloads
      Abstract
      This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimises the makespan. We present here an adaptation of the Depth-bounded Discrepancy Search (DDS) method to obtain near-optimal solutions with makespan of high quality. This adaptation for the HFS contains no redundancy for the search tree expansion. To improve the solutions of our HFS problem, we propose a local search method, called Climbing Depth-bounded Discrepancy Search (CDDS), which is a hybridisation of two existing discrepancy-based methods: DDS and Climbing Discrepancy Search (CDS). CDDS introduces an intensification process around promising solutions. These methods are tested on benchmark problems. Results show that discrepancy methods give promising results and CDDS method gives the best solutions.
      Keywords
      Scheduling
      Hybrid flow shop
      HFS
      Discrepancy search methods
      Climbing depth-bounded discrepancy search
      CDDS
      Lower bounds
      LBs
      Heuristics
      Permalink
      http://hdl.handle.net/11693/49131
      Collections
      • Department of Management 639
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy