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

Date

2010

Authors

Selvi, O.
Gokbayrak, K.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

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

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
BUIR Usage Stats
3
views
10
downloads

Series

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.

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)