Skip to main content

2013 | OriginalPaper | Buchkapitel

13. Study on an Affected Operations Rescheduling Method Responding to Stochastic Disturbances

verfasst von : Ya-qin Zhou, Bei-zhi Li, Jian-guo Yang, Peng Yang

Erschienen in: Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012)

Verlag: Springer Berlin Heidelberg

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

search-config
loading …

Abstract

Literature on job shop scheduling has primarily focused on the development of predictive schedules in static environment. However, when the schedule is carried out in job shop, it may affected by varied disturbances. These disturbances will make the original schedule worse, even invalid. Rescheduling is the process of finding a new schedule to respond to the stochastic disturbances. In this paper, an affected operations rescheduling method (AORM) is studied to respond to disturbances. First, the basic theory of the method is given. Then the algorithmic procedure is introduced. The objective functions evaluating the rescheduling method are given. At last, an illustration example is tested and analyzed. The result shows that the rescheduling method proposed can produce new optimal schedules to respond to stochastic disturbances.

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

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!

Literatur
Zurück zum Zitat Abumaizar RJ, Svestka JA (1997) Rescheduling job shops under random disruptions. Int J Prod Res 35(7):2065–2082CrossRef Abumaizar RJ, Svestka JA (1997) Rescheduling job shops under random disruptions. Int J Prod Res 35(7):2065–2082CrossRef
Zurück zum Zitat Adibi MA, Zandieh M, Amiri M (2010) Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Syst Appl 37(1):282–287CrossRef Adibi MA, Zandieh M, Amiri M (2010) Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Syst Appl 37(1):282–287CrossRef
Zurück zum Zitat Cao Y, Du J (2011) An improved Simulated Annealing algorithm for real-time dynamic job-shop scheduling. Adv Mater Res 186:636–639CrossRef Cao Y, Du J (2011) An improved Simulated Annealing algorithm for real-time dynamic job-shop scheduling. Adv Mater Res 186:636–639CrossRef
Zurück zum Zitat Eswaramurthy VP, Tamilarasi A (2007) Tabu search strategies for solving job shop scheduling problems. J Adv Manuf Syst 6(1):59–75CrossRef Eswaramurthy VP, Tamilarasi A (2007) Tabu search strategies for solving job shop scheduling problems. J Adv Manuf Syst 6(1):59–75CrossRef
Zurück zum Zitat Garey EL, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129CrossRef Garey EL, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129CrossRef
Zurück zum Zitat Geyik F, Cedimoglu IH (2004) The strategies and parameters of tabu search for job-shop scheduling. J Intell Manuf 15(4):439–448CrossRef Geyik F, Cedimoglu IH (2004) The strategies and parameters of tabu search for job-shop scheduling. J Intell Manuf 15(4):439–448CrossRef
Zurück zum Zitat Ibrahim S, El-Baz MA, Esh E (2009) Neural networks for job shop scheduling problems. J Eng Appl Sci 56(2):169–183 Ibrahim S, El-Baz MA, Esh E (2009) Neural networks for job shop scheduling problems. J Eng Appl Sci 56(2):169–183
Zurück zum Zitat Jamili A, Mohammad A, Tavakkoli-Moghaddam R (2011) A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem. Int J Adv Manuf Technol 54(1–4):309–322CrossRef Jamili A, Mohammad A, Tavakkoli-Moghaddam R (2011) A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem. Int J Adv Manuf Technol 54(1–4):309–322CrossRef
Zurück zum Zitat Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh
Zurück zum Zitat Li R, Shyu Y, Adiga S (1993) A heuristic rescheduling algorithm for computer-based production scheduling systems. Int J Prod Res 31(8):1815–1826CrossRef Li R, Shyu Y, Adiga S (1993) A heuristic rescheduling algorithm for computer-based production scheduling systems. Int J Prod Res 31(8):1815–1826CrossRef
Zurück zum Zitat Ritwik K, Deb S (2011) A genetic algorithm-based approach for optimization of scheduling in job shop environment. J Adv Manuf Syst 10(2):223–240CrossRef Ritwik K, Deb S (2011) A genetic algorithm-based approach for optimization of scheduling in job shop environment. J Adv Manuf Syst 10(2):223–240CrossRef
Zurück zum Zitat Wang YM, Yin HL, Wang J (2009) Genetic algorithm with new encoding scheme for job shop scheduling. Int J Adv Manuf Technol 44(9–10):977–984CrossRef Wang YM, Yin HL, Wang J (2009) Genetic algorithm with new encoding scheme for job shop scheduling. Int J Adv Manuf Technol 44(9–10):977–984CrossRef
Zurück zum Zitat Zhang R, Wu C (2010) A hybrid immune simulated annealing algorithm for the job shop scheduling problem. Appl Soft Comput J 10(1):79–89CrossRef Zhang R, Wu C (2010) A hybrid immune simulated annealing algorithm for the job shop scheduling problem. Appl Soft Comput J 10(1):79–89CrossRef
Zurück zum Zitat Zhao FQ, Zou JH, Yang YH (2010) A hybrid approach based on Artificial Neural Network (ANN) and Differential Evolution (DE) for job-shop scheduling problem. Appl Mech Mater 26–28:754–757CrossRef Zhao FQ, Zou JH, Yang YH (2010) A hybrid approach based on Artificial Neural Network (ANN) and Differential Evolution (DE) for job-shop scheduling problem. Appl Mech Mater 26–28:754–757CrossRef
Zurück zum Zitat Zhou YQ, Li BZ, Yang JG (2006) Intelligent scheduling algorithm for problems with batch and non cutting time. Jixie Gongcheng Xuebao/Chin J Mech Eng 42(1):52–566 (Chinese)CrossRef Zhou YQ, Li BZ, Yang JG (2006) Intelligent scheduling algorithm for problems with batch and non cutting time. Jixie Gongcheng Xuebao/Chin J Mech Eng 42(1):52–566 (Chinese)CrossRef
Metadaten
Titel
Study on an Affected Operations Rescheduling Method Responding to Stochastic Disturbances
verfasst von
Ya-qin Zhou
Bei-zhi Li
Jian-guo Yang
Peng Yang
Copyright-Jahr
2013
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-33012-4_13

Premium Partner