• 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.

      Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

      Thumbnail
      View / Download
      339.3 Kb
      Author(s)
      Akturk, M. S.
      Ilhan, T.
      Date
      2011
      Source Title
      Computers & Operations Research
      Print ISSN
      0305-0548
      Electronic ISSN
      1873-765X
      Publisher
      Elsevier
      Volume
      38
      Issue
      4
      Pages
      771 - 781
      Language
      English
      Type
      Article
      Item Usage Stats
      218
      views
      321
      downloads
      Abstract
      Advanced manufacturing technologies, such as CNC machines, require significant investments, but also offer new capabilities to the manufacturers. One of the important capabilities of a CNC machine is the controllable processing times. By using this capability, the due date requirements of customers can be satisfied much more effectively. Processing times of the jobs on a CNC machine can be easily controlled via machining conditions such that they can be increased or decreased at the expense of tooling cost. Since scheduling decisions are very sensitive to the processing times, we solve the process planning and scheduling problems simultaneously. In this study, we consider the problem of scheduling a set of jobs on a single CNC machine to minimize the sum of total weighted tardiness, tooling and machining costs. We formulated the joint problem, which is NP-hard since the total weighted tardiness problem (with fixed processing times) is strongly NP-hard alone, as a nonlinear mixed integer program. We proposed a DP-based heuristic to solve the problem for a given sequence and designed a local search algorithm that uses it as a base heuristic.
      Keywords
      Single machine scheduling
      Weighted tardiness
      Tool management
      Controllable processing time
      Permalink
      http://hdl.handle.net/11693/21977
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2010.09.004
      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