• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Parallel machine scheduling subject to machine availability constraints

      Thumbnail
      View / Download
      1.3 Mb
      Author
      Sevindik, Kaya
      Advisor
      Taner, Mehmet Rüştü
      Date
      2006
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      101
      views
      43
      downloads
      Abstract
      Within a planning horizon, machines may become unavailable due to unexpected breakdowns or pre-scheduled activities. A realistic approach in constructing the production schedule should explicitly take into account such periods of unavailability. This study addresses the parallel machine-scheduling problem subject to availability constraints on each machine. The objectives of minimizing the total completion time and minimizing the maximum completion time are studied. The problems with both objectives are known to be NP-hard. We develop an exact branch-and-bound procedure and propose three heuristic algorithms for the total completion time problem. Similarly, we propose exact and approximation algorithms also for the maximum completion time problem. All proposed algorithms are tested through extensive computational experimentation, and several insights are provided based on computational results.
      Keywords
      Scheduling
      Parallel Machines
      Total Completion Time
      Makespan
      Availability Constraints
      Heuristics
      Permalink
      http://hdl.handle.net/11693/29777
      Collections
      • Dept. of Industrial Engineering - Master's degree 326
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      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 1771
      Copyright © Bilkent University - Library IT

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