Abstract
The subject of the study is ordered flow shop scheduling problems which were first seen in the literature in the 1970s. The main objective is to get a fast and good solution. For the purpose of the study, firstly, the ordered flow shop scheduling problems were defined. Then, a heuristic method was suggested for the ordered flow shop scheduling problems and a sample problem was solved and discussed. A genetic algorithm (GA) based on the complexity property was developed. Full enumeration was applied to determine the optimal makespan values based on Smith’s rule because Smith had specified the conditions under which circumstances the permutation can be optimum.
This study is one of the few studies in the literature to obtain optimum solutions up to 15 jobs ordered flow shop problems in a very short amount of time. The developed GA heuristic can also solve large size ordered flow shop scheduling problems very fast. The significant advantage of the proposed method is that, while Smith’s method rule not does not work with large size problems since it requires full enumeration to identify best solution to follow a convexity property where GA algorithm can find a good solution very fast.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aldowaisan, T., Allahverdi, A.: New Heuristics for M-Machine No-Wait Flowshop to Minimize Total Completion Time. Kuwait University, Kuwait (2004)
Coffman, E. (n.d.). Preface. Opns. Res. (26), 1–2
Dudek, R., Panwalkar, S., Smith, M.: The lessons of flow scheduling research. Oper. Res. 40, 7–13 (1992)
Elmaghraby, S.: The machine sequencing problem-review and extensions. Nav. Res. Log. Q. 15, 205–232 (1986)
Gupta, J., Stafford, E.: Flow shop scheduling research after five decades. Eur. J. Oper. Res. 169, 375–381 (2006)
Hejazi, S., Saghafian, S.: Flow shop scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43, 2895–2929 (2005)
Iyer, S., Barkha, S.: Improved genetic algorithm for the permutation flowshop scheduling problem. Comput. Oper. Res. 31, 593–606 (2004)
Johnson, S.: Optimal two and three stage production schedules with setup times included. Nav. Res. Log. Q. 1, 61–68 (1954)
Panwalkar, S., Woollam, C.: Ordered flow shop problems with no in-process waiting: further results. J. Opl. Res. Soc. 31, 1039–1043 (1980)
Panwalkar, S., Woollam, C. (n.d.).: Flow shop scheduling problems with no in-process waiting: a special case. J. Opl. Res. 30, 661–664 (1979)
Panwalkar, S., Dudek, R., Smith, M.: Sequencing research and industrial scheduling problem. In: proceedings of the Symposium on the Theory of Scheduling and Its Applications. Berlin (1973)
Reddy, S., Ramamoorthy, C. (n.d.).: On the flowshop sequencing problem with no wait in process. Opl. Res. (23), 323–331
Smith, M.: A Critical Analysis of Flow Shop Sequencing. Texas Tech University, Lubbock (1968)
Smith, M., Dudek, R., Panwalkar, S.: Job sequencing with ordered processing time matrix, pp. 481–486. Wisconsin: 43rd Meeting of ORSA (1973)
Smith, M., Panwalkar, S., Dudek, R.: Flowshop sequencing problem with ordered processing times matrices. Manage. Sci. 21, 544–549 (1975)
Torkashvand, M., Naderi, B., Hosseini, S.: Modelling and scheduling multi-objective flow shop problems with interfering jobs. Appl. Soft. Comput. 54, 221–228 (2017)
Wismer, D. (n.d.).: Solution of the flowshop scheduling problem with no intermediate queue. Op. Res. 20, 689–697
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Çakmak, A., Ceylan, Z., Bulkan, S. (2024). An Ordered Flow Shop Scheduling Problem. In: Şen, Z., Uygun, Ö., Erden, C. (eds) Advances in Intelligent Manufacturing and Service System Informatics. IMSS 2023. Lecture Notes in Mechanical Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-99-6062-0_16
Download citation
DOI: https://doi.org/10.1007/978-981-99-6062-0_16
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6061-3
Online ISBN: 978-981-99-6062-0
eBook Packages: EngineeringEngineering (R0)