Abstract
This paper considers a discrete artificial bee colony (DABC) algorithm for the blocking flow shop (BFS) scheduling problem to minimize total flowtime. The DABC algorithm utilizes discrete job permutations to represent food sources and applies discrete operators to generate new food sources for the employed bees, onlookers and scouts. First, an initialization scheme based on MME (combination of MinMax and NEH) heuristic is presented to construct an initial population with a certain level of quality and diversity. Second, a local search based on the insertion neighborhood is applied to onlooker stage to improve the algorithm’s local exploitation ability. Third, a destruction-construction operator is employed to obtain solutions for the scout bees. Computational simulations and comparisons show that the proposed algorithm (DABC) is effective and efficient for the blocking flow shop scheduling problems with total flowtime criterion.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Storn, R., Price, K.: Differential Evolution—A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces. Journal of Global Optimization 11, 341–359 (1997)
Allahverdi, A., Ng, C.T., Cheng, T.C.E., et al.: A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research 187, 985–1032 (2008)
McCormich, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research 37, 925–936 (1989)
Laha, D. C., Subhash, S.: A Heuristic to Minimize Total Flowtime in Permutation Flowshop. Omega 37, 734–739 (2009)
Leisten, R.: Flowshop Sequencing Problems with Limited Buffer Storage. International Journal of Production Research 28, 2085–2100 (1990)
Ronconi, D.P.: A Note on Constructive Heuristics for the Flowshop Problem with Blocking. International Journal of Production Economics 87, 39–48 (2004)
Croce, F., Della, G.M., Tadei, R.: An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research 139, 293–301 (2002)
Caraffa, V., Ianes, S., Bagchi, T., Sriskandarajah, C.: Minimizing Makespan in a Blocking Flowshop Using Genetic Algorithms. International Journal of Production Economics 70, 102–115 (2001)
Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A Discrete Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem. Computers and Industrial Engineering 55, 795–816 (2008)
Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the Total Flow Time in a Flow Shop with Blocking by Using Hybrid Harmony Search Algorithms. Expert Systems with Applications (submitted for publication, 2010)
Karaboga, D.: An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report TR06. Computer Engineering Department. Erciyes University,Turkey (2005)
Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A Discrete Artificial Bee Colony Algorithm for the Lot-streaming Flow Shop Scheduling Problem. Infromation Sciences (2010)
Ruiz, R., Thomas, S.: An Iterated Greedy Heuristic for the Sequence Dependent Setup Times Flowshop Problem with Makespan and Weighted Tardiness Objectives. European Journal of Operational Research 187, 1143–1159 (2008)
Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operational Research 64, 278–285 (1993)
Nawaz, M., Enscore, E.E.J., Ham, I.: A Heuristic Algorithm for Them-machine, n-job Flow Shop Sequencing Problem. International Journal of Management Science 11, 91–95 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, YY., Duan, JH., Yang, YJ., Zhang, M., Yun, B. (2012). Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-25944-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25943-2
Online ISBN: 978-3-642-25944-9
eBook Packages: Computer ScienceComputer Science (R0)