[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Artificial bee colony algorithms for the order scheduling with release dates

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • 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–97

    Article  Google Scholar 

  • Ahmadi R, Bagchi U, Roemer TA (2005) Coordinated scheduling of customer orders for quick response. Naval Res Logist 52:493–512

    Article  MathSciNet  MATH  Google Scholar 

  • Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26:219–235

    Article  MathSciNet  MATH  Google Scholar 

  • 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–14

    Article  Google Scholar 

  • 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–981

    Article  Google Scholar 

  • 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–295

    Article  Google Scholar 

  • 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–2103

    Article  MATH  Google Scholar 

  • Erel E, Ghosh JB (2007) Customer order scheduling on a single machine with family setup times: complexity and algorithms. Appl Math Comput 185:11–18

    MathSciNet  MATH  Google Scholar 

  • 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–192

    Article  MathSciNet  MATH  Google Scholar 

  • French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. Ellis Horwood Limited, Chichester

    MATH  Google Scholar 

  • Hsu SY, Liu CH (2009) Improving the delivery efficiency of the customer order scheduling problem in a job shop. Comput Ind Eng 57:856–866

    Article  Google Scholar 

  • 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):04015040

    Article  Google Scholar 

  • 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–25

    Article  Google Scholar 

  • 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–6120

    Article  MathSciNet  Google Scholar 

  • 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–56

    Article  Google Scholar 

  • 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–103

    Chapter  Google Scholar 

  • Lee I-S (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144:128–134

    Article  Google Scholar 

  • Leung JYT, Li H, Pinedo M (2005a) Order scheduling in an environment with dedicated resources in parallel. J Sched 8:355–386

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT, Li H, Pinedo M, Sriskandarajah C (2005b) Open shops with jobs overlap-revisited. Eur J Oper Res 163(2):569–571

    Article  MathSciNet  MATH  Google Scholar 

  • 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–260

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT, Li H, Pinedo M (2006b) Scheduling orders for multiple product types with due date related objectives. Eur J Oper Res 168:370–389

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT, Li H, Pinedo M (2007a) Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl Math 155:945–970

    Article  MathSciNet  MATH  Google Scholar 

  • 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–129

    Article  MathSciNet  MATH  Google Scholar 

  • 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–123

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT, Lee CY, Ng CW, Young GH (2008b) Preemptive multiprocessor order scheduling to minimize total weighted flowtime. Eur J Oper Res 190:40–51

    Article  MathSciNet  MATH  Google Scholar 

  • 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–1659

    Article  MathSciNet  Google Scholar 

  • Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944–948

    Article  MATH  Google Scholar 

  • 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–884

    Article  Google Scholar 

  • 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–2750

    Article  MATH  Google Scholar 

  • Reeves C (1995) Heuristics for scheduling a single machine subject to unequal job release times. Eur J Oper Res 80:397–403

    Article  Google Scholar 

  • Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625–631

    Article  Google Scholar 

  • Singh S, Mann P (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40–52

    Article  Google Scholar 

  • Sundar S, Singh A (2012) A swarm intelligence approach to the early/tardy scheduling problem. Swarm Evol Comput 4:25–32

    Article  Google Scholar 

  • 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–255

    Article  Google Scholar 

  • Teodorovic D (2003) Transport modeling by multi-agent systems: a swarm intelligence approach. Transp Plan Technol 26–4(August):289–312

    Article  Google Scholar 

  • 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–816

    Chapter  Google Scholar 

  • Tereshko V, Lee T (2002) How information mapping patterns determine foraging behaviour of a honey bee colony. Open Syst Inf Dyn 9:181–193

    Article  MathSciNet  MATH  Google Scholar 

  • 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–378

    Article  MATH  Google Scholar 

  • Wang G, Cheng TCE (2007) Customer order scheduling to minimize total weighted completion time. Omega 35:623–626

    Article  Google Scholar 

  • 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–2033

    Article  MATH  Google Scholar 

  • 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–816

    MATH  Google Scholar 

  • 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–213

    Article  Google Scholar 

  • 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–119

    Article  Google Scholar 

  • 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–186

    Article  MathSciNet  MATH  Google Scholar 

  • Xu X, Zhao Y, Wu M, Zhou Z, Ma Y (2016b) Stochastic customer order scheduling to minimize long-run expected order cycle time. Ann Oper Res. https://doi.org/10.1007/s10479-016-2254-9

  • 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–2952

    Article  Google Scholar 

  • Yang XS (2005a) Engineering optimizations via nature-inspired virtual bee algorithms, Lecture Notes in Computer Science, 3562. Springer, Berlin

    Google Scholar 

  • Yang J (2005b) The complexity of customer order scheduling problems on parallel machines. Comput Oper Res 32:1921–1939

    Article  MathSciNet  MATH  Google Scholar 

  • Yang J, Posner ME (2005) Scheduling parallel machines for the customer order problem. J Sched 8:49–74

    Article  MathSciNet  MATH  Google Scholar 

  • Yoon SH, Sung CS (2005) Fixed pre-assembly scheduling on multiple fabrication machines. Int J Prod Econ 96:109–118

    Article  Google Scholar 

  • Zhao Y, Xu X, Li H, Liu Y (2016) Prioritized customer order scheduling to maximize throughput. Eur J Oper Res 255(2):345–356

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Authors thank the Associate Editor and three anonymous referees for their helpful comments on the earlier versions of our paper. This paper was supported in part by the Ministry of Science Technology (MOST) of Taiwan under Grant Nos. MOST 103-2410-H-035-022-MY2 and MOST 105-2221-E-035-053-MY3. Authors thank Prof. Kunjung Lai of the Department of Statistics, Feng Chia University, for helping us to edit the English language.

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, Taichung, 40724, Taiwan

    Win-Chin Lin, I-Hong Chung & Chin-Chia Wu

  2. College of Information Science and Engineering, Northeastern University, Shenyang, 110819, China

    Jianyou Xu

  3. College of Economics and Management, Nanjing Forestry University, Nanjing, 210037, China

    Danyu Bai

  4. Department of Business Administration, Fujen Catholic University, New Taipei City, Taiwan

    Shang-Chia Liu

Authors
  1. Win-Chin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianyou Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Danyu Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. I-Hong Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shang-Chia Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chin-Chia Wu.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Ethical approval

This article does not contain any studies with human participants performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, WC., Xu, J., Bai, D. et al. Artificial bee colony algorithms for the order scheduling with release dates. Soft Comput 23, 8677–8688 (2019). https://doi.org/10.1007/s00500-018-3466-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-3466-5

Keywords

Search

Navigation