Skip to main content
Springer Nature Link
Log in

A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint

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

Abstract

This paper studies a hybrid artificial bee colony (ABC) algorithm for finding high quality solutions of the job-shop scheduling problem with no-wait constraint (JSPNW) with the objective of minimizing makespan among all the jobs. JSPNW is an extension of well-known job-shop scheduling problem subject to the constraint that no waiting time is allowed between operations for a given job. ABC algorithm is a swarm intelligence technique based on intelligent foraging behavior of honey bee swarm. The proposed hybrid approach effectively coordinates the various components of ABC algorithm such as solution initialization, selection and determination of a neighboring solution with the local search in such a way that it leads to high quality solutions for the JSPNW. The proposed approach is compared with the two best approaches in the literature on a set of benchmark instances. Computational results show the superiority of the proposed approach over these two best approaches.

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
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

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

  • Beasley JE (1990) Or-library: distribution test problems by electronic mail. J Oper Res Soc 41:1069–1072

    Article  Google Scholar 

  • Birattari M (2005) Tuning metaheuristics: a machine learning perspective. Springer, Berlin

  • Bożejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56:1502–1509

  • Bożejko W, Makuchowski M (2011) Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment. Int J Adv Manuf Technol 57:735–752

    Article  Google Scholar 

  • Brizuela CA, Zhao Y, Sannomiya N (2001) No-wait and blocking job-shops: Challenging problems for GA’s. In: IEEE international conference on systems, man, and cybernetics. IEEE, New York, pp 2349–2354

  • Dorn J, Shams R (1996) Scheduling high-grade steelmaking. IEEE Exp 11:28–35

    Article  Google Scholar 

  • Framinan JM, Schuster CJ (2006) An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput Oper Res 331:1200–1213

    Article  MATH  Google Scholar 

  • Grabowski J, Pempera J, Smutnicki C (1997) Scheduling in production of concrete wares. In: Operations research proceedings 1996. Springer, Berlin, pp 192–196

  • Hall N, Sriskandarajah C (1996) A survey on machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525

    Article  MathSciNet  MATH  Google Scholar 

  • Kamoun H, Sriskandarajah C (1993) The complexity of scheduling jobs in repetitive manufacturing systems. Eur J Oper Res 70:350–364

    Article  MATH  Google Scholar 

  • Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, technical report—tr06. Erciyes University, Turkey

  • Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 42(1):21–57

    Article  Google Scholar 

  • Kubiak W (1989) A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem. Eur J Oper Res 43:267–270

    Article  MathSciNet  MATH  Google Scholar 

  • Lenstra JK, Kan AHGR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343–362

    Article  MathSciNet  MATH  Google Scholar 

  • Lixin T, Liu J, Rong A, Yang Z (2000) A mathematical programming model for scheduling steelmaking-continuous casting production. Eur J Oper Res 120:423–435

    Article  MATH  Google Scholar 

  • Macchiaroli R, Molè S, Riemma S, Trifiletti L (1996) Design and implementation of a tabu search algorithm to solve the no-wait job-shop scheduling problem. In: Proceeding of the CESA96, pp 467–472

  • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143:498–517

    Article  MathSciNet  MATH  Google Scholar 

  • Pan JC-H, Huang H-C (2009) A hybrid genetic algorithm for no-wait job shop scheduling problems. Exp Syst Appl 36:5800–5806

    Article  Google Scholar 

  • Pan Q-K, Tasgetiren M, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:28072839

    Article  MathSciNet  MATH  Google Scholar 

  • Pan Q-K, Tasgetiren M, Suganthan P, Chua T (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455–2468

    Article  MathSciNet  Google Scholar 

  • Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice-Hall, NJ

    MATH  Google Scholar 

  • Reklaitis G (1982) Review of scheduling of process operations. AIChE Symp Ser 78:119–133

    Google Scholar 

  • Ridge E, Kudenko D (2010) Tuning an algorithm using design of experiments. In: Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (ed) Experimental methods for the analysis of optimization algorithms. Springer, Berlin, pp 265–286

  • Roy B, Sussmann B (1964) Les problèmes d’ordonnancement avec constraintes disjonctives. SEMA, Note D.S., No. 9, Paris

  • Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Math Oper Res 4:448–457

    Article  MathSciNet  MATH  Google Scholar 

  • Schuster CJ (2006) No-wait job shop scheduling: Tabu search and complexity of subproblems. Math Meth Oper Res 63:473–491

    Article  MathSciNet  MATH  Google Scholar 

  • Schuster CJ, Framinan J (2003) Approximate procedures for no-wait job shop scheduling. Oper Res Lett 31:308–318

    Article  MathSciNet  MATH  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 A (2010) A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem. Asia-Pac J Oper Res 27:713–725

    Article  MathSciNet  Google Scholar 

  • Sriskandarajah C, Ladet P (1986) Some no-wait shops scheduling problems: complexity aspects. Eur J Oper Res 24:424–438

    Article  MathSciNet  MATH  Google Scholar 

  • Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic multiple knapsack problem. In: ICONIP 2010. Lecture notes in computer science, vol 6443. Springer, Berlin, pp 626–633

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

  • Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, New York

  • Tasgetiren M, Pan Q-K, Suganthan P, Chen AH-L (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf Sci 181:3459–3475

    Article  MathSciNet  Google Scholar 

  • Valente J, Gonçalves J, Alves R (2006) A hybrid genetic algorithm for the early/tardy scheduling problem. Asia-Pac J Oper Res 23:393–405

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu J, Li X (2012) An effective meta-heuristic for no-wait job shops to minimize makespan. IEEE Trans Autom Sci Eng 9:189–198

    Google Scholar 

  • Zhu J, Li X, Wang Q (2009) Complete local search with limited memory algorithm for no-wait job shops to minimize makespan. Eur J Oper Res 198:378–386

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Applications, National Institute of Technology Raipur, Raipur, 492010, India

    Shyam Sundar

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, 639798, Singapore

    P. N. Suganthan

  3. Singapore Institute of Manufacturing Technology, 71, Nanyang Drive, Singapore, 638075, Singapore

    Chua Tay Jin, Cai Tian Xiang & Chong Chin Soon

Authors
  1. Shyam Sundar
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. P. N. Suganthan
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Chua Tay Jin
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Cai Tian Xiang
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Chong Chin Soon
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Shyam Sundar.

Ethics declarations

Conflict of interest

We declare that we have no conflict of interests.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sundar, S., Suganthan, P.N., Jin, C.T. et al. A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21, 1193–1202 (2017). https://doi.org/10.1007/s00500-015-1852-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1852-9

Keywords