Selvi, O.Gokbayrak, K.2016-02-082016-02-0820100377-2217http://hdl.handle.net/11693/22238We 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.EnglishControllable service timesConvex programmingFlow shopSearch methodTrust-region methodsConvex programmingFlow-shopsSearch methodService timeTrust-region methodsMachine shop practiceSet theoryOptimizationArticle10.1016/j.ejor.2009.12.0281872-6860