Skip to main content
Erschienen in: Neural Computing and Applications 6/2016

01.08.2016 | Original Article

Research on group search optimizers for a reconfigurable flow shop sequencing problem

verfasst von: Hadi Mokhtari

Erschienen in: Neural Computing and Applications | Ausgabe 6/2016

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A reconfigurable manufacturing system is usually designed for quick re-adjusting of production capacity in response to market changes. In this paper, we study a flow shop sequencing problem (FSSP) with controllable processing times as a special case of reconfigurable manufacturing system. It is possible to speed up the processing times through assigning additional resources or control of machine speed. After formulating this problem mathematically, a novel evolutionary procedure, entitled group search optimizer (GSO), is devised as solution method. The adapted GSO is a population-based search tool which is devised based on the producer and scrounger behavior. GSO emphasizes on imitating searching model of real-world animals. The basic GSO with four promising improvements is elaborated and discussed for addressing the FSSP with controllable processing times. A set of computational experiments is also conducted to demonstrate the applicability of proposed FSSP and performance of improved GSOs.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

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+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!

Literatur
1.
Zurück zum Zitat Al-Fawzan MA, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96:175–187CrossRef Al-Fawzan MA, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96:175–187CrossRef
2.
Zurück zum Zitat Bulfin RL, Hallah M (2003) Minimizing the weighted number of tardy jobs on a two-machine flow shop. Comput Oper Res 30:1887–1900MathSciNetCrossRefMATH Bulfin RL, Hallah M (2003) Minimizing the weighted number of tardy jobs on a two-machine flow shop. Comput Oper Res 30:1887–1900MathSciNetCrossRefMATH
3.
Zurück zum Zitat Choi B-C, Yoon S-H, Chung S-J (2007) Single machine scheduling problem with controllable processing times and resource dependent release times. Euro J Oper Res 181:645–653MathSciNetCrossRefMATH Choi B-C, Yoon S-H, Chung S-J (2007) Single machine scheduling problem with controllable processing times and resource dependent release times. Euro J Oper Res 181:645–653MathSciNetCrossRefMATH
4.
Zurück zum Zitat Daniel Ng CC, Edwin Cheng TC, Kovalyov MY, Lam SS (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Comput Oper Res 30:1173–1185MathSciNetCrossRefMATH Daniel Ng CC, Edwin Cheng TC, Kovalyov MY, Lam SS (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Comput Oper Res 30:1173–1185MathSciNetCrossRefMATH
5.
Zurück zum Zitat Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197–2212MathSciNetCrossRefMATH Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197–2212MathSciNetCrossRefMATH
6.
Zurück zum Zitat Gupta JND, Stafford EF (2006) Flow shop scheduling research after five decades. Euro J Oper Res 169:699–711CrossRefMATH Gupta JND, Stafford EF (2006) Flow shop scheduling research after five decades. Euro J Oper Res 169:699–711CrossRefMATH
7.
Zurück zum Zitat Haq AN, Ramanan TR, Shashikant KS, Sridharan R (2010) A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling. Int J Prod Res 48(14):4217–4231CrossRefMATH Haq AN, Ramanan TR, Shashikant KS, Sridharan R (2010) A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling. Int J Prod Res 48(14):4217–4231CrossRefMATH
8.
Zurück zum Zitat He G, Cui Z, Tan Y (2012) Interactive dynamic neighborhood differential evolutionary group search optimizer. J Chin Comput Syst 33(4):809–814 He G, Cui Z, Tan Y (2012) Interactive dynamic neighborhood differential evolutionary group search optimizer. J Chin Comput Syst 33(4):809–814
9.
Zurück zum Zitat He S (2010) Training artificial neural networks using Levy group search optimizer. J Multi-Valued Log Soft Comput 16:527–546MathSciNetMATH He S (2010) Training artificial neural networks using Levy group search optimizer. J Multi-Valued Log Soft Comput 16:527–546MathSciNetMATH
10.
Zurück zum Zitat He S, Wu QH, Saunders JR (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973–990CrossRef He S, Wu QH, Saunders JR (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973–990CrossRef
11.
Zurück zum Zitat Huang J-Y, Yao M-J (2008) A genetic algorithm for solving the economic lot scheduling problem in flow shops. Int J Prod Res 46(14):3737–3761CrossRefMATH Huang J-Y, Yao M-J (2008) A genetic algorithm for solving the economic lot scheduling problem in flow shops. Int J Prod Res 46(14):3737–3761CrossRefMATH
12.
Zurück zum Zitat Janiak A (1985) Time-optimal control in a single machine problem with resource constraints. Automatica 22:745–747CrossRefMATH Janiak A (1985) Time-optimal control in a single machine problem with resource constraints. Automatica 22:745–747CrossRefMATH
13.
Zurück zum Zitat Janiak A (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika 23:289–293MathSciNetMATH Janiak A (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika 23:289–293MathSciNetMATH
14.
Zurück zum Zitat Janiak A, Kovalyov MY (1996) Single machine scheduling subjective to deadlines and resource dependent processing times. Eur J Oper Res 94:284–291CrossRefMATH Janiak A, Kovalyov MY (1996) Single machine scheduling subjective to deadlines and resource dependent processing times. Eur J Oper Res 94:284–291CrossRefMATH
15.
Zurück zum Zitat Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Quart 1(1):61–68CrossRef Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Quart 1(1):61–68CrossRef
16.
Zurück zum Zitat Lee CY, Lei L (2001) Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Ann Oper Res 102:287–307MathSciNetCrossRefMATH Lee CY, Lei L (2001) Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Ann Oper Res 102:287–307MathSciNetCrossRefMATH
17.
Zurück zum Zitat Li K, Shi Y, Yang SL, Cheng BY (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551–5557CrossRef Li K, Shi Y, Yang SL, Cheng BY (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551–5557CrossRef
18.
Zurück zum Zitat Mokhtari H (2015) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Comput Appl 26(5):1085–1101CrossRef Mokhtari H (2015) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Comput Appl 26(5):1085–1101CrossRef
19.
Zurück zum Zitat Mokhtari H, Abadi INK, Cheraghalikhani A (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makes pan and cost of resources. Int J Prod Res 49(19):5851–5875CrossRef Mokhtari H, Abadi INK, Cheraghalikhani A (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makes pan and cost of resources. Int J Prod Res 49(19):5851–5875CrossRef
20.
Zurück zum Zitat Mokhtari H, Abadi INK, Zegordi SH (2011) Production capacity planning and scheduling in a no-wait environment with controllable processing times: an integrated modeling approach. Expert Syst Appl 38:12630–12642CrossRef Mokhtari H, Abadi INK, Zegordi SH (2011) Production capacity planning and scheduling in a no-wait environment with controllable processing times: an integrated modeling approach. Expert Syst Appl 38:12630–12642CrossRef
21.
Zurück zum Zitat Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26:271–287MathSciNetCrossRefMATH Nowicki E, Zdrzalka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26:271–287MathSciNetCrossRefMATH
23.
Zurück zum Zitat Qian B, Wang L, Huang DX, Wang WL, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 36:209–233MathSciNetCrossRefMATH Qian B, Wang L, Huang DX, Wang WL, Wang X (2009) An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput Oper Res 36:209–233MathSciNetCrossRefMATH
24.
Zurück zum Zitat Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13:79–102MathSciNetCrossRefMATH Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13:79–102MathSciNetCrossRefMATH
25.
Zurück zum Zitat Ravindran D, Noorul Haq A, Selvakuar SJ, Sivaraman R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manuf Technol 25:1007–1012CrossRef Ravindran D, Noorul Haq A, Selvakuar SJ, Sivaraman R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manuf Technol 25:1007–1012CrossRef
26.
Zurück zum Zitat Shabtay D, Steiner G (2007) Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf Serv Oper Manag 9:332–350 Shabtay D, Steiner G (2007) Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manuf Serv Oper Manag 9:332–350
27.
Zurück zum Zitat Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072–5090MathSciNetCrossRefMATH Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072–5090MathSciNetCrossRefMATH
28.
Zurück zum Zitat Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Euro J Oper Res 152:96–114MathSciNetCrossRefMATH Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Euro J Oper Res 152:96–114MathSciNetCrossRefMATH
29.
Zurück zum Zitat Tseng C-T, Liao C-J (2008) A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Prod Res 46(17):4655–4670CrossRefMATH Tseng C-T, Liao C-J (2008) A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Prod Res 46(17):4655–4670CrossRefMATH
30.
Zurück zum Zitat Wang J, Ng C, Cheng T, Liu L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193MathSciNetMATH Wang J, Ng C, Cheng T, Liu L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193MathSciNetMATH
32.
Zurück zum Zitat Xu J, Zhou X (2009) A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem. Inf Sci 179:2997–3017MathSciNetCrossRefMATH Xu J, Zhou X (2009) A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem. Inf Sci 179:2997–3017MathSciNetCrossRefMATH
33.
Zurück zum Zitat Yang T, Kuo Y, Chang I (2004) Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors—a case study. Int J Prod Res 42(19):4015–4030CrossRefMATH Yang T, Kuo Y, Chang I (2004) Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors—a case study. Int J Prod Res 42(19):4015–4030CrossRefMATH
34.
Zurück zum Zitat Yao J, Cui ZH, Wei ZH, Tan Y (2011) Hybrid group search optimiser with quadratic interpolation method and its application. Int J Wirel Mob Comput 5:98–106CrossRef Yao J, Cui ZH, Wei ZH, Tan Y (2011) Hybrid group search optimiser with quadratic interpolation method and its application. Int J Wirel Mob Comput 5:98–106CrossRef
35.
Zurück zum Zitat Zandieh M, Gholami M (2009) An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Prod Res 47(24):6999–7027CrossRefMATH Zandieh M, Gholami M (2009) An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Prod Res 47(24):6999–7027CrossRefMATH
Metadaten
Titel
Research on group search optimizers for a reconfigurable flow shop sequencing problem
verfasst von
Hadi Mokhtari
Publikationsdatum
01.08.2016
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 6/2016
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-015-1963-3

Weitere Artikel der Ausgabe 6/2016

Neural Computing and Applications 6/2016 Zur Ausgabe