Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

2020 | OriginalPaper | Buchkapitel

A Discrete Artificial Immune System Algorithm for the Lot Streaming Flow Shop Scheduling Problem

verfasst von: R. Kamalakannan, M. Shunmugasundaram, R. Nagaraj, D. Aravindhan, S. Mohammed Thouffic

Erschienen in: Advances in Lightweight Materials and Structures

Verlag: Springer Singapore

share
TEILEN

Abstract

This paper attempts to present the challenge of scheduling n jobs–m machines in the flow shop scheduling environment. In this scheduling, lot streaming is a method used to divide up multiple sublots to allow functions to intersect across multiple production systems. The purpose of this work is to reduce the time and save the manufacturing cost. In recent times, researchers have used bright heuristics to explain flow shop difficulties on a lot streaming problem. In this work, artificial immune system (AIS) algorithm is used to solve the lot streaming concept in the flow shop scheduling environment with the objective of minimizing the makespan time. In addition, a nature ability to change to suit different conditions for generating the neighborhood antibodies based on the inverse and pairwise mutation. The results obtained by this algorithm are compared with the standard benchmark instances. This proposed algorithm is capable and establishes to be a superior problem-solving technique for this flow shop scheduling with lot streaming.

Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

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

  • über 69.000 Bücher
  • über 500 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

Testen Sie jetzt 15 Tage kostenlos.

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 50.000 Bücher
  • über 380 Zeitschriften

aus folgenden Fachgebieten:

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




Testen Sie jetzt 15 Tage kostenlos.

Literatur
1.
Zurück zum Zitat Sule DR (1997) Industrial planning. PWS Publishing Company, USA Sule DR (1997) Industrial planning. PWS Publishing Company, USA
2.
Zurück zum Zitat Pinedo M, Chao X (1997) Operational planning. Irwin McGraw-Hill, New York Pinedo M, Chao X (1997) Operational planning. Irwin McGraw-Hill, New York
3.
Zurück zum Zitat Baker KR (1974) Introduction to sorting and planning. Wiley, New York Baker KR (1974) Introduction to sorting and planning. Wiley, New York
4.
Zurück zum Zitat Potts CN, Wassenhove LN (1992) Compiling and integrating scheduling with lots of volume: a methodological and complex study. J Oper Res Soc 43(5):395–406 CrossRef Potts CN, Wassenhove LN (1992) Compiling and integrating scheduling with lots of volume: a methodological and complex study. J Oper Res Soc 43(5):395–406 CrossRef
5.
Zurück zum Zitat Potts CN, Baker KR (1989) Flow shop planning with lots of streaming. Oper Res Lett 8:297–303 CrossRef Potts CN, Baker KR (1989) Flow shop planning with lots of streaming. Oper Res Lett 8:297–303 CrossRef
6.
Zurück zum Zitat Baker KR (1995) Lots of streaming in two machines ow ow store with setup times. An Opport Res 57:1–11 CrossRef Baker KR (1995) Lots of streaming in two machines ow ow store with setup times. An Opport Res 57:1–11 CrossRef
7.
Zurück zum Zitat Glass CA, Gupta JNT, Potts CN (1994) Lots of streaming in a three-phase process. Eur J Oper Res 75:378–394 CrossRef Glass CA, Gupta JNT, Potts CN (1994) Lots of streaming in a three-phase process. Eur J Oper Res 75:378–394 CrossRef
8.
Zurück zum Zitat Kamalakannan R, Sudhakara Pandian R, Sivakumar P (2019) A simulated annealing for the cell formation problem with ratio level data. Int J Enterp Netw Manage 10(1):78–89 Kamalakannan R, Sudhakara Pandian R, Sivakumar P (2019) A simulated annealing for the cell formation problem with ratio level data. Int J Enterp Netw Manage 10(1):78–89
9.
Zurück zum Zitat Sriskandarajah C, Wagner E (1999) Scheduling multiple products in the parking lot and two machine no-wait ow ow store. IIE Trans 31:695–707 Sriskandarajah C, Wagner E (1999) Scheduling multiple products in the parking lot and two machine no-wait ow ow store. IIE Trans 31:695–707
10.
Zurück zum Zitat Kamalakannan R, Sudhakara Pandian R, Sivakumar P (2018) A tabu search strategy for the cell formation problem using ratio level data. Int J Bus Intel Data Min 13(1–3):209–220 Kamalakannan R, Sudhakara Pandian R, Sivakumar P (2018) A tabu search strategy for the cell formation problem using ratio level data. Int J Bus Intel Data Min 13(1–3):209–220
11.
Zurück zum Zitat Hall NG, LaPorte G, Selvarajah E, Srikandarajah C (2003) Planning and streaming a lot in ow stores. J Plan 6(4):339–354 Hall NG, LaPorte G, Selvarajah E, Srikandarajah C (2003) Planning and streaming a lot in ow stores. J Plan 6(4):339–354
12.
Zurück zum Zitat Liu SC (2003) A heuristic method for streaming unique lots with variable subplots in an ow ow store. Int J Adv Manuf Technol 22:662–668 CrossRef Liu SC (2003) A heuristic method for streaming unique lots with variable subplots in an ow ow store. Int J Adv Manuf Technol 22:662–668 CrossRef
13.
Zurück zum Zitat Eng O, Doyen A (2004) A new approach to solving hybrid flow shop planning problems by artificial immune system. Future Gener Syst Syst 20:1083–1095 CrossRef Eng O, Doyen A (2004) A new approach to solving hybrid flow shop planning problems by artificial immune system. Future Gener Syst Syst 20:1083–1095 CrossRef
14.
Zurück zum Zitat Zheng H, Zhang J, Nahawandi S (2004) Learning to detect textures by artificial immune approaches. Fut Gener Comput Syst 20:1197–1208 CrossRef Zheng H, Zhang J, Nahawandi S (2004) Learning to detect textures by artificial immune approaches. Fut Gener Comput Syst 20:1197–1208 CrossRef
15.
Zurück zum Zitat Vijay Chakravarthy G, Marimuthu S, Naveen Sait A (2012) Comparision of firefly algorithm and artificial immune system algorithm for lot streaming in m machine flow shop scheduling. Int J Comput Intel Syst 5(6):1184–1189 CrossRef Vijay Chakravarthy G, Marimuthu S, Naveen Sait A (2012) Comparision of firefly algorithm and artificial immune system algorithm for lot streaming in m machine flow shop scheduling. Int J Comput Intel Syst 5(6):1184–1189 CrossRef
16.
Zurück zum Zitat Chandrasekharan M, Asokan P, Kumanan S, Balamurugan T, Nickolas S (2006) Solving job scheduling problems using artificial immune system. Int J Adv Manuf Technol 31:580–593 CrossRef Chandrasekharan M, Asokan P, Kumanan S, Balamurugan T, Nickolas S (2006) Solving job scheduling problems using artificial immune system. Int J Adv Manuf Technol 31:580–593 CrossRef
17.
Zurück zum Zitat Marimuthu S, Ponnambalam SG, Jawahar N (2008) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Rob Comput Integr Manuf 24:125–139 CrossRef Marimuthu S, Ponnambalam SG, Jawahar N (2008) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Rob Comput Integr Manuf 24:125–139 CrossRef
18.
Zurück zum Zitat Vijay Chakravarthy G, Marimuthu S, Ponnambalam SG, Kanagaraj G (2014) Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling m-machine flow shops lot streaming with equal size sub-lot problems. Int J Prod Res 52(5):1509–1527 CrossRef Vijay Chakravarthy G, Marimuthu S, Ponnambalam SG, Kanagaraj G (2014) Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling m-machine flow shops lot streaming with equal size sub-lot problems. Int J Prod Res 52(5):1509–1527 CrossRef
19.
Zurück zum Zitat Marimuthu S, Ponnambalam SG, Jawahar N (2009) Threshold accepting and Ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. J Mater Proces Technol 209:1026–1041 CrossRef Marimuthu S, Ponnambalam SG, Jawahar N (2009) Threshold accepting and Ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming. J Mater Proces Technol 209:1026–1041 CrossRef
20.
Zurück zum Zitat Khatami M, Salehipour A (2019) Hwang FJ, Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput Oper Res 111:400–414 CrossRef Khatami M, Salehipour A (2019) Hwang FJ, Makespan minimization for the m-machine ordered flow shop scheduling problem. Comput Oper Res 111:400–414 CrossRef
Metadaten
Titel
A Discrete Artificial Immune System Algorithm for the Lot Streaming Flow Shop Scheduling Problem
verfasst von
R. Kamalakannan
M. Shunmugasundaram
R. Nagaraj
D. Aravindhan
S. Mohammed Thouffic
Copyright-Jahr
2020
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-7827-4_83

Premium Partner

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.