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

      Optimization of a flow shop system of initially controllable machines

      Thumbnail
      View / Download
      171.1 Kb
      Author(s)
      Gokbayrak, K.
      Selvi, O.
      Date
      2008-12-22
      Source Title
      IEEE Transactions on Automatic Control
      Print ISSN
      0018-9286
      Electronic ISSN
      1558-2256
      Publisher
      IEEE
       
      Institute of Electrical and Electronics Engineers
       
      Volume
      53
      Issue
      11
      Pages
      2665 - 2668
      Language
      English
      Type
      Article
      Item Usage Stats
      158
      views
      213
      downloads
      Abstract
      We consider an optimization problem for deterministic flow shop systems of traditional machines with service costs penalizing small service times. A regular completion-time cost is also included so as to complete jobs as early as possible. The service times are assumed to be initially controllable, i.e., they are set at the startup time. Assuming convexity of the cost functions, we formulate a convex optimization problem after linearization of the max constraints. The numeric solution of this problem demands a large memory limiting the solvable system sizes. In order to relieve the memory bottleneck, some waiting characteristics of jobs served in fixed-service- time flow shop systems are exploited to result in a simpler equivalent convex optimization problem. These characteristics and the benefit of CNC machines are demonstrated in a numerical example.We also show that the simplifications result in significant improvements in solvable system sizes and solution times.
      Keywords
      Convex Optimization
      Discrete Event Dynamic Systems, Manufacturing
      Manufacturing
      Permalink
      http://hdl.handle.net/11693/11679
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TAC.2008.2007153
      Collections
      • Department of Industrial Engineering 758
      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