Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Soft Computing
Erschienen in: Soft Computing 18/2019

28.08.2018 | Methodologies and Application

Artificial bee colony algorithms for the order scheduling with release dates

verfasst von: Win-Chin Lin, Jianyou Xu, Danyu Bai, I-Hong Chung, Shang-Chia Liu, Chin-Chia Wu

Erschienen in: Soft Computing | Ausgabe 18/2019

Einloggen

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

search-config
loading …

Abstract

The order scheduling models have kept growing attention in the research community. However, as studying research regarding order scheduling models with release dates is relatively limited; this study addresses an order scheduling problem with release dates where the objective function is to minimize the weighted number of tardy orders of all the given orders. To solve this intractable problem, this study first proposes some dominance properties and a lower bound used in a branch-and-bound method for finding an optimal solution. This paper then utilizes four basic bee colony algorithms, and four hybrid bee colony algorithms for searching the optimal solution and approximate solution, and performs one-way analysis of variance and Fisher’s least significant difference tests to determine and evaluate the performances of all eight proposed algorithms.
Vorheriger Artikel A weighted graph-oriented ontology matching algorithm for enhancing ontology mapping and alignment in Semantic Web
Nächster Artikel Artificial bee colony clustering with self-adaptive crossover and stepwise search for brain functional parcellation in fMRI data

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Literatur
Abba Ari AA, Yenke BO, Labraoui N, Damakoa I, Gueroui A (2016) A power efficient cluster-based routing algorithm for wireless sensor networks: honeybees swarm intelligence based approach. J Netw Comput Appl 69:77–97CrossRef
Ahmadi R, Bagchi U, Roemer TA (2005) Coordinated scheduling of customer orders for quick response. Naval Res Logist 52:493–512MathSciNetCrossRefMATH
Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26:219–235MathSciNetCrossRefMATH
Aydoğdu I, Akın A, Saka MP (2016) Design optimization of real world steel space frames using artificial bee colony algorithm with Levy flight distribution. Adv Eng Softw 92:1–14CrossRef
Basturk B, Karaboga D (2006) An artificial bee colony (ABC) algorithm for numeric function optimization. In: IEEE swarm intelligence symposium 2006, May 12–14, Indianapolis, IN, USA
Benatchba K, Admane L, Koudıl M (2005) Using bees to solve data-mining problem expressed as a max-sat one, artificial intelligence and knowledge engineering applications: a bioinspired approach. In: First international work-conference on the interplay between natural and artificial computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15–18
Blocher JD, Chhajed D, Leung M (1998) Customer order scheduling in a general job shop environment. Decis Sci 29(4):951–981CrossRef
Chaurasia SN, Sundar S, Singh A (2016) Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release date. Oper Res Int J 17(1):275–295CrossRef
Cheng S-R, Yin Y, Wen C-H, Lin W-C, Wu C-C, Liu J (2017) A two-machine flowshop scheduling problem with precedence constraint on two jobs. Soft Comput 21(8):2091–2103CrossRefMATH
Erel E, Ghosh JB (2007) Customer order scheduling on a single machine with family setup times: complexity and algorithms. Appl Math Comput 185:11–18MathSciNetMATH
Framinan JM, Perez-Gonzalez P (2017) New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput Oper Res 78:181–192MathSciNetCrossRefMATH
French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. Ellis Horwood Limited, ChichesterMATH
Hsu SY, Liu CH (2009) Improving the delivery efficiency of the customer order scheduling problem in a job shop. Comput Ind Eng 57:856–866CrossRef
Kang F, Li J (2016) Artificial bee colony algorithm optimized support vector regression for system reliability analysis of slopes. J Comput Civ Eng 30(3):04015040CrossRef
Kang F, Salgado R, Li J (2015) System probabilistic stability analysis of soil slopes using Gaussian process regression with Latin hypercube sampling. Comput Geotech 63:13–25CrossRef
Kang F, Xu Q, Li J (2016a) Slope reliability analysis using surrogate models via new support vector machines with swarm intelligence. Appl Math Model 40(11–12):6105–6120MathSciNetCrossRef
Kang F, Li J-S, Li J (2016b) System reliability analysis of slopes using least squares support vector machines with particle swarm optimization. Neurocomputing 209:46–56CrossRef
Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Plenum, New York, pp 85–103CrossRef
Lee I-S (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144:128–134CrossRef
Leung JYT, Li H, Pinedo M (2005a) Order scheduling in an environment with dedicated resources in parallel. J Sched 8:355–386MathSciNetCrossRefMATH
Leung JYT, Li H, Pinedo M (2006a) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Res Logist 53:243–260MathSciNetCrossRefMATH
Leung JYT, Li H, Pinedo M (2006b) Scheduling orders for multiple product types with due date related objectives. Eur J Oper Res 168:370–389MathSciNetCrossRefMATH
Leung JYT, Li H, Pinedo M (2007a) Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl Math 155:945–970MathSciNetCrossRefMATH
Leung JYT, Li H, Pinedo M, Zhang J (2007b) Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Inf Process Lett 103:119–129MathSciNetCrossRefMATH
Leung JYT, Li H, Pinedo M (2008a) Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann Oper Res 159:107–123MathSciNetCrossRefMATH
Leung JYT, Lee CY, Ng CW, Young GH (2008b) Preemptive multiprocessor order scheduling to minimize total weighted flowtime. Eur J Oper Res 190:40–51MathSciNetCrossRefMATH
Liang H, Yao X, Newton C, Hoffman D (2002) A new evolutionary approach to cutting stock problems with and without contiguity. Comput Oper Res 29:1641–1659MathSciNetCrossRef
Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944–948CrossRefMATH
Lin WC, Yin Y, Cheng SR, Cheng TCE, Wu CH, Wu C-C (2017) Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Appl Soft Comput 52:877–884CrossRef
Lucic P, Teodorovic D (2002) Transportation modeling: an artificial life approach. In: ICTAI, pp 216–223
Monch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput Oper Res 32:2731–2750CrossRefMATH
Reeves C (1995) Heuristics for scheduling a single machine subject to unequal job release times. Eur J Oper Res 80:397–403CrossRef
Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625–631CrossRef
Singh S, Mann P (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40–52CrossRef
Sundar S, Singh A (2012) A swarm intelligence approach to the early/tardy scheduling problem. Swarm Evol Comput 4:25–32CrossRef
Sung CS, Yoon SH (1998) Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int J Prod Econ 54:247–255CrossRef
Teodorovic D (2003) Transport modeling by multi-agent systems: a swarm intelligence approach. Transp Plan Technol 26–4(August):289–312CrossRef
Teodorovic D, Dell’orco M (2005) Bee colony optimisation—a cooperative learning approach to complex transportation problems. In: 10th EWGT Meeting, Poznan, 13–16
Tereshko V (2000) Reaction–diffusion model of a honeybee colony’s foraging behaviour. In: Schoenauer M et al (eds) Parallel problem solving from nature VI, Lecture Notes in Computer Science, vol 1917. Springer, Berlin, pp 807–816CrossRef
Tereshko V, Lee T (2002) How information mapping patterns determine foraging behaviour of a honey bee colony. Open Syst Inf Dyn 9:181–193MathSciNetCrossRefMATH
Tereshko V, Loengarov A (2005) Collective decision-making in honey bee foraging dynamics. In: Computing and information systems, pp 1352–94049
Wagneur E, Sriskandarajah C (1993) Open shops with jobs overlap. Eur J Oper Res 71:366–378CrossRefMATH
Wang G, Cheng TCE (2007) Customer order scheduling to minimize total weighted completion time. Omega 35:623–626CrossRef
Wang D-J, Kang C-C, Shiau Y-R, Wu C-C, Hsu P-H (2017a) A two-agent single-machine scheduling problem with late work criteria. Soft Comput 21:2015–2033CrossRefMATH
Wang DJ, Yin Y, Wu W-H, Wu W-H, Wu C-C, Hsu PH (2017b) A two-agent single-machine scheduling problem to minimize the total cost with release dates. Soft Comput 21:806–816MATH
Wedde HF, Farooq M, Zhang Y (2004) BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior, ant colony, optimization and swarm intelligence. In: 4th international workshop, ANTS 2004, Brussels, Belgium, September 5–8
Wu C-C, Liu DS, Lin TY, Yang TH, Chung IH, Lin WC (2018) Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem. Comput Ind Eng 117:156–213CrossRef
Xin Y, Wang Y-D, Xie ZQ, Yang J (2017) A cooperative scheduling method based on the device load feedback for multiple tasks scheduling. J Netw Comput Appl 99:110–119CrossRef
Xu J, Wu C-C, Yin Y, Zhao CL, Chiou Y-T, Lin WC (2016a) An order scheduling problem with position-based learning effect. Comput Oper Res 74:175–186MathSciNetCrossRefMATH
Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22(9):2935–2952CrossRef
Yang XS (2005a) Engineering optimizations via nature-inspired virtual bee algorithms, Lecture Notes in Computer Science, 3562. Springer, Berlin
Yoon SH, Sung CS (2005) Fixed pre-assembly scheduling on multiple fabrication machines. Int J Prod Econ 96:109–118CrossRef
Zhao Y, Xu X, Li H, Liu Y (2016) Prioritized customer order scheduling to maximize throughput. Eur J Oper Res 255(2):345–356MathSciNetCrossRefMATH
Metadaten
Titel
Artificial bee colony algorithms for the order scheduling with release dates
verfasst von
Win-Chin Lin
Jianyou Xu
Danyu Bai
I-Hong Chung
Shang-Chia Liu
Chin-Chia Wu
Publikationsdatum
28.08.2018
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 18/2019
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-018-3466-5

Weitere Artikel der Ausgabe 18/2019

Soft Computing 18/2019 Zur Ausgabe

Focus

A novel linear SVM-based compressive collaborative spectrum sensing (CCSS) scheme for IoT cognitive 5G network

Methodologies and Application

Dual hesitant fuzzy matrix games: based on new similarity measure

Focus

Analysis of antlion optimizer-based ABT for automatic generation control of an interconnected power system

Focus

An approach to enhance packet classification performance of software-defined network using deep learning

Methodologies and Application

A new adaptive neuro-fuzzy solution for optimization of the parameters in the digital holography setup

Methodologies and Application

Patent data analysis using functional count data model