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

      Scheduling with tool changes to minimize total completion time under controllable machining conditions

      Thumbnail
      View / Download
      217.1 Kb
      Author(s)
      Akturk, M. S.
      Ghosh, J. B.
      Kayan, R. K.
      Date
      2007-07
      Source Title
      Computers and Operations Research
      Print ISSN
      0305-0548
      Electronic ISSN
      1873-765X
      Publisher
      Elsevier
      Volume
      34
      Issue
      7
      Pages
      2130 - 2146
      Language
      English
      Type
      Article
      Item Usage Stats
      154
      views
      150
      downloads
      Abstract
      Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention. Though machining conditions impact tool wear and induce tool change, the two issues have not been considered together.We address for the first time the problem of scheduling a computer numerically controlled (CNC) machine subject to tool changes and controllable machining conditions; our objective is to minimize the total completion time of a given set of jobs. We establish an important result that helps us identify feasible settings of machining parameters such as feed rate and cutting speed. However, the problem at hand remains intractable, even when a single setting is used. In the general case, we are able to solve the problem exactly for up to 30 jobs using a mixed integer linear programming formulation. For larger problems, we turn to approximate solution via heuristics. We examine a number of different schemes. The best of these schemes are used in a problem space genetic algorithm; this produces quality solutions in a time-efficient manner, as is evidenced from an extensive computational study conducted by us. 2005 Elsevier Ltd. All rights reserved.
      Keywords
      Scheduling
      Heuristics
      Cnc Machines
      Permalink
      http://hdl.handle.net/11693/11437
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2005.08.014
      Collections
      • Department of Industrial Engineering 733
      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