• About
  • Policies
  • What is openaccess
  • 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.

      A search method for optimal control of a flow shop system of traditional machines

      Thumbnail
      View / Download
      275.0 Kb
      Author
      Selvi, O.
      Gokbayrak, K.
      Date
      2010
      Source Title
      European Journal of Operational Research
      Print ISSN
      0377-2217
      Electronic ISSN
      1872-6860
      Publisher
      Elsevier
      Volume
      205
      Issue
      2
      Pages
      325 - 331
      Language
      English
      Type
      Article
      Item Usage Stats
      157
      views
      138
      downloads
      Abstract
      We consider a convex and nondifferentiable optimization problem for deterministic flow shop systems in which the arrival times of the jobs are known and jobs are processed in the order they arrive. The decision variables are the service times that are to be set only once before processing the first job, and cannot be altered between processes. The cost objective is the sum of regular costs on job completion times and service costs inversely proportional to the controllable service times. A finite set of subproblems, which can be solved by trust-region methods, are defined and their solutions are related to the optimal solution of the optimization problem under consideration. Exploiting these relationships, we introduce a two-phase search method which converges in a finite number of iterations. A numerical study is held to demonstrate the solution performance of the search method compared to a subgradient method proposed in earlier work.
      Keywords
      Controllable service times
      Convex programming
      Flow shop
      Search method
      Trust-region methods
      Convex programming
      Flow-shops
      Search method
      Service time
      Trust-region methods
      Machine shop practice
      Set theory
      Optimization
      Permalink
      http://hdl.handle.net/11693/22238
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.ejor.2009.12.028
      Collections
      • Department of Industrial Engineering 677
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Analyzing large sparse Markov chains of Kronecker products 

        Dayar, Tuğrul (IEEE, 2009)
        Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ...
      • Thumbnail

        Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods 

        Özaktaş, Hakan (Bilkent University, 1998)
        Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ...
      • Thumbnail

        Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays 

        Ertürk, Vakur B.; Chou, H. T. (IEEE, 2002)
        An acceleration algorithm based on Discrete Fourier Transform (DFT) is developed to reduce the computational complexity and memory storages of iterative methods of moment (IMoM) solution to O(Ntot), where Ntot is the total ...

      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