A subgradient descent algorithm for optimization of initially controllable flow shop systems

Date
2009
Authors
Gokbayrak, K.
Selvi, O.
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Discrete Event Dynamic Systems
Print ISSN
0924-6703
Electronic ISSN
1573-7594
Publisher
Volume
19
Issue
2
Pages
267 - 282
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
Abstract

We consider an optimization problem for deterministic flow shop systems processing identical jobs. The service times are initially controllable; they can only be set before processing the first job, and cannot be altered between processes. We derive some waiting and completion time characteristics for fixed service time flow shop systems, independent of the cost formulation. Exploiting these characteristics, an equivalent convex optimization problem, which is non-differentiable, is derived along with its subgradient descent solution algorithm. This algorithm not only eliminates the need for convex programming solvers but also allows for the solution of larger systems due to its smaller memory requirements. Significant improvements in solution times are also observed in the numerical examples.

Course
Other identifiers
Book Title
Keywords
Convex optimization, Subgradient descent algorithm, Initially controllable service times, Flow shop
Citation
Published Version (Please cite this version)