Skip to main content
Top

2024 | OriginalPaper | Chapter

An Ordered Flow Shop Scheduling Problem

Authors : Aslıhan Çakmak, Zeynep Ceylan, Serol Bulkan

Published in: Advances in Intelligent Manufacturing and Service System Informatics

Publisher: Springer Nature Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The chapter delves into the ordered flow shop scheduling problem, a subcategory of the flow shop problem with ordered processing times. It introduces the makespan objective and outlines the use of genetic algorithms for solving this complex problem. The proposed method leverages the convexity property to obtain feasible solutions and modifies the crossover and mutation processes to enhance efficiency. The chapter also compares the proposed method with Smith’s algorithm, highlighting its superior performance in execution time and ability to handle larger problem sizes. The results and discussions provide insights into the effectiveness of the proposed method, making it a valuable read for professionals interested in advanced scheduling techniques.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Aldowaisan, T., Allahverdi, A.: New Heuristics for M-Machine No-Wait Flowshop to Minimize Total Completion Time. Kuwait University, Kuwait (2004)CrossRefMATH Aldowaisan, T., Allahverdi, A.: New Heuristics for M-Machine No-Wait Flowshop to Minimize Total Completion Time. Kuwait University, Kuwait (2004)CrossRefMATH
go back to reference Coffman, E. (n.d.). Preface. Opns. Res. (26), 1–2 Coffman, E. (n.d.). Preface. Opns. Res. (26), 1–2
go back to reference Dudek, R., Panwalkar, S., Smith, M.: The lessons of flow scheduling research. Oper. Res. 40, 7–13 (1992) Dudek, R., Panwalkar, S., Smith, M.: The lessons of flow scheduling research. Oper. Res. 40, 7–13 (1992)
go back to reference Elmaghraby, S.: The machine sequencing problem-review and extensions. Nav. Res. Log. Q. 15, 205–232 (1986) Elmaghraby, S.: The machine sequencing problem-review and extensions. Nav. Res. Log. Q. 15, 205–232 (1986)
go back to reference Gupta, J., Stafford, E.: Flow shop scheduling research after five decades. Eur. J. Oper. Res. 169, 375–381 (2006) Gupta, J., Stafford, E.: Flow shop scheduling research after five decades. Eur. J. Oper. Res. 169, 375–381 (2006)
go back to reference Hejazi, S., Saghafian, S.: Flow shop scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43, 2895–2929 (2005) Hejazi, S., Saghafian, S.: Flow shop scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43, 2895–2929 (2005)
go back to reference Iyer, S., Barkha, S.: Improved genetic algorithm for the permutation flowshop scheduling problem. Comput. Oper. Res. 31, 593–606 (2004) Iyer, S., Barkha, S.: Improved genetic algorithm for the permutation flowshop scheduling problem. Comput. Oper. Res. 31, 593–606 (2004)
go back to reference Johnson, S.: Optimal two and three stage production schedules with setup times included. Nav. Res. Log. Q. 1, 61–68 (1954) Johnson, S.: Optimal two and three stage production schedules with setup times included. Nav. Res. Log. Q. 1, 61–68 (1954)
go back to reference 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.: Ordered flow shop problems with no in-process waiting: further results. J. Opl. Res. Soc. 31, 1039–1043 (1980)
go back to reference 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., Woollam, C. (n.d.).: Flow shop scheduling problems with no in-process waiting: a special case. J. Opl. Res. 30, 661–664 (1979)
go back to reference 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) 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)
go back to reference Reddy, S., Ramamoorthy, C. (n.d.).: On the flowshop sequencing problem with no wait in process. Opl. Res. (23), 323–331 Reddy, S., Ramamoorthy, C. (n.d.).: On the flowshop sequencing problem with no wait in process. Opl. Res. (23), 323–331
go back to reference Smith, M.: A Critical Analysis of Flow Shop Sequencing. Texas Tech University, Lubbock (1968) Smith, M.: A Critical Analysis of Flow Shop Sequencing. Texas Tech University, Lubbock (1968)
go back to reference Smith, M., Dudek, R., Panwalkar, S.: Job sequencing with ordered processing time matrix, pp. 481–486. Wisconsin: 43rd Meeting of ORSA (1973) Smith, M., Dudek, R., Panwalkar, S.: Job sequencing with ordered processing time matrix, pp. 481–486. Wisconsin: 43rd Meeting of ORSA (1973)
go back to reference Smith, M., Panwalkar, S., Dudek, R.: Flowshop sequencing problem with ordered processing times matrices. Manage. Sci. 21, 544–549 (1975) Smith, M., Panwalkar, S., Dudek, R.: Flowshop sequencing problem with ordered processing times matrices. Manage. Sci. 21, 544–549 (1975)
go back to reference Torkashvand, M., Naderi, B., Hosseini, S.: Modelling and scheduling multi-objective flow shop problems with interfering jobs. Appl. Soft. Comput. 54, 221–228 (2017) Torkashvand, M., Naderi, B., Hosseini, S.: Modelling and scheduling multi-objective flow shop problems with interfering jobs. Appl. Soft. Comput. 54, 221–228 (2017)
go back to reference Wismer, D. (n.d.).: Solution of the flowshop scheduling problem with no intermediate queue. Op. Res. 20, 689–697 Wismer, D. (n.d.).: Solution of the flowshop scheduling problem with no intermediate queue. Op. Res. 20, 689–697
Metadata
Title
An Ordered Flow Shop Scheduling Problem
Authors
Aslıhan Çakmak
Zeynep Ceylan
Serol Bulkan
Copyright Year
2024
Publisher
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-99-6062-0_16

Premium Partners