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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertsekas DP (1995) Nonlinear programming. Athena Scientific, Belmont, Massachusetts
Cassandras CG, Lafortune S (1999) Introduction to discrete event systems. Kluwer Academic, Dordrecht
Cassandras CG, Pepyne DL, Wardi Y (2001) Optimal control of a class of hybrid systems. IEEE Trans Automat Control 46(3):398–415
Cassandras CG, Liu Q, Pepyne DL, Gokbayrak K (1999) Optimal control of a two-stage hybrid manufacturing system model. In: Proceedings of 38th IEEE conference on decision and control, pp 450–455
Cho YC, Cassandras CG, Pepyne DL (2001) Forward decomposition algorithms for optimal control of a class of hybrid systems. Int J Robust Nonlinear Control 11:497–513
Gazarik M, Wardi Y (1998) Optimal release times in a single server: an optimal control perspective. IEEE Trans Automat Control 43(7):998–1002
Gokbayrak K, Cassandras CG (2000) Constrained optimal control for multistage hybrid manufacturing system models. In: Proceedings of 8th IEEE Mediterranean conference on new directions in control and automation
Gokbayrak K, Selvi O (2006) Optimal hybrid control of a two-stage manufacturing system. In: Proceedings of ACC, pp 3364–3369
Gokbayrak K, Selvi O (2007) Constrained optimal hybrid control of a flow shop system. IEEE Trans Automat Control 52–12:2270–2281
Gokbayrak K, Selvi O (2008) Optimization of a flow shop system of initially controllable machines. IEEE Trans Automat Control 53:2665–2668
Grant M, Boyd S (2007) CVX: Matlab software for disciplined convex programming. http://stanford.edu/~boyd/cvx
Kalpakjian S, Schmid SR (2006) Manufacturing engineering and technology. Pearson Prentice Hall, Singapore
Moon J, Wardi Y (2005) Optimal control of processing times in single-stage discrete event dynamic systems with blocking. IEEE Trans Automat Control 50(6):880–884
Pepyne DL, Cassandras CG (1998) Modeling, analysis, and optimal control of a class of hybrid systems. J Discrete Event Dyn Syst: Theory Appl 8(2):175–201
Pepyne DL, Cassandras CG (2000) Optimal control of hybrid systems in manufacturing. Proc IEEE 88(7):1108–1123
Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood Cliffs
Wardi Y, Cassandras CG, Pepyne DL (2001) A backward algorithm for computing optimal controls for single-stage hybrid manufacturing systems. Int J Product Res 39–2:369–393
Zhang P, Cassandras CG (2002) An improved forward algorithm for optimal control of a class of hybrid systems. IEEE Trans Automat Control 47–10:1735–1739
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gokbayrak, K., Selvi, O. A Subgradient Descent Algorithm for Optimization of Initially Controllable Flow Shop Systems. Discrete Event Dyn Syst 19, 267–282 (2009). https://doi.org/10.1007/s10626-009-0061-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10626-009-0061-z