Skip to main content
SpringerLink
Log in

Minimization of total completion time on a batch processing machine with arbitrary release dates: an effectual teaching–learning based optimization approach

  • Production Management
  • Published:
Production Engineering Aims and scope Submit manuscript

Abstract

In this research study, a single machine batch-processing problem with release dates to minimize the total completion times of jobs is considered. The machine is able to process at most a certain number of jobs at the same time and the total size of the jobs allocated to a batch cannot exceed the machine capacity. Since the research problem has been shown to be NP-hard, an effective Teaching–Learning Based Optimization (TLBO) is proposed. A constructive heuristic approach is developed to generate initial feasible solutions for the TLBO. In order to enhance the efficiency of the proposed TLBO, a Tabu Search (TS) with three different neighborhood generation mechanisms is incorporated into the teaching phase and learner phase separately. To validate the outcomes of the proposed TLBO, we carry out an experimental study and compare its outcomes with the best-known results obtained by several meta-heuristic methods on a set of benchmark instances derived from the literature. The computational results show that the proposed TLBO with the incorporation of TS in its learning phase is able to come up with very good quality solutions.

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

Access this article

Log in via an institution

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

References

  1. Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615–1635

    Article  MATH  Google Scholar 

  2. Lee C-Y, Uzsoy R (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int J Prod Res 37(1):219–236

    Article  MATH  Google Scholar 

  3. Baker R, Trietsch D (2009) Principles of sequencing and scheduling. Wiley, New Jersey

    Book  MATH  Google Scholar 

  4. Jolai Ghazvini F, Dupont L (1998) Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. Int J Prod Econ 55(3):273–280

    Article  Google Scholar 

  5. Beldar P, Costa A (2018). Single machine batch processing problem with release dates to minimize total completion time. Int J Ind Eng Comput 9(3), 331–348. Retrieved from https://www.researchgate.net/publication/329982505_Data_and_Resultsrar

  6. Brucker P (2007) Scheduling algorithms. Springer, New York

    MATH  Google Scholar 

  7. Chandru V, Lee C-Y, Uzsoy R (1993) Minimizing total completion time on batch processing machines. Int J Prod Res 31(9):2097–2121

    Article  MATH  Google Scholar 

  8. Uzsoy R, Yang Y (1997) Minimizing total weighted completion time on a single batch processing machine. Prod Oper Manag 6(1):57–73

    Article  Google Scholar 

  9. Liu Z, Yu W (2000) Scheduling one batch processor subject to job release dates. Discrete Aplp Math 105(1–3):129–136

    Article  MathSciNet  MATH  Google Scholar 

  10. Dupont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29(7):807–819

    Article  MathSciNet  MATH  Google Scholar 

  11. Chang P-C, Wang H-M (2004) A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes. Int J Adv Manuf Technol 24(7–8):615–620

    Article  Google Scholar 

  12. Melouk S, Damodaran P, Chang P-Y (2004) Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int J Prod Econ 87(2):141–147

    Article  Google Scholar 

  13. Damodaran P, Kumar Manjeshwar P, Srihari K (2006) Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. Int J Prod Econ 103(2):882–891

    Article  Google Scholar 

  14. Damodaran P, Srihari K, Lam S (2007) Scheduling a capacitated batch-processing machine to minimize makespan. Robot Comput Integr Manuf 23(2):208–216

    Article  Google Scholar 

  15. Rafiee Parsa N, Karimi B, Husseinzadeh Kashan A (2010) A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Comput Oper Res 37(10):1720–1730

    Article  MathSciNet  MATH  Google Scholar 

  16. Xu R, Chen H, Li X (2012) Makespan minimization on single batch-processing machine via ant colony optimization. Comput Oper Res 39(3):582–593

    Article  MathSciNet  MATH  Google Scholar 

  17. Lee Y, Lee Y (2013) Minimising makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes. Int J Prod Res 51(12):3488–3500

    Article  Google Scholar 

  18. Jia Z-H, Leung J-T (2014) An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes. Comput Oper Res 46:49–58

    Article  MathSciNet  MATH  Google Scholar 

  19. Zhou S, Chen H, Xu R, Li X (2014) Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes. Int J Prod Res 52(8):2258–2274

    Article  Google Scholar 

  20. Al-Salamah M (2015) Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Appl Soft Comput 29:379–385

    Article  Google Scholar 

  21. Rafiee Parsa N, Karimi B, Moattar Husseini S (2016) Minimizing total flow time on a batch processing machine using a hybrid max–min ant system. Comput Ind Eng 99:372–381

    Article  Google Scholar 

  22. Chung T-P, Sun H (2017) Scheduling batch processing machine problem with non-identical job sizes via artificial immune system. J Ind Prod Eng 35(3):129–134

    Google Scholar 

  23. El-Ghazali T (2009) Metaheuristics: from design to implementation. Wiley, New Jersey

    MATH  Google Scholar 

  24. Keesari H, Rao R (2014) Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm. OPSEARCH 51(4):545–561

    Article  MathSciNet  MATH  Google Scholar 

  25. Xu Y, Wang L, Wang S-Y, Liu M (2015) An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing 148:260–268

    Article  Google Scholar 

  26. Shao W, Pi D, Shao Z (2017) An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl Soft Comput 61:193–210

    Article  Google Scholar 

  27. Rao R, Savsani V, Vakharia D (2011) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315

    Article  Google Scholar 

  28. Rao R, Savsani V, Vakharia D (2012) Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15

    Article  MathSciNet  Google Scholar 

  29. Zhang R, Song S, Wu C (2013) A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion. Appl Soft Comput 13(3):1448–1458

    Article  Google Scholar 

  30. Gohari S, Salmasi N (2015) Flexible flowline scheduling problem with constraints for the beginning and terminating time of processing of jobs at stages. Int J Comput Integr Manuf 28(10):1092–1105

    Google Scholar 

  31. Zou F, Wang L, Hei X, Chen D, Yang D (2014) Teaching–learning-based optimization with dynamic group strategy for global optimization. Inf Sci 273:112–131

    Article  Google Scholar 

  32. Xie Z, Zhang C, Shao X, Lin W, Zhu H (2014) An effective hybrid teaching–learning-based optimization algorithm for permutation flow shop scheduling problem. Adv Eng Softw 77:35–47

    Article  Google Scholar 

  33. Qiuhua T, Zixiang L, LiPing Z, Chaoyong Z (2017) Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm. Comput Oper Res 82:102–113

    Article  MathSciNet  MATH  Google Scholar 

  34. Chen X, Xu B, Mei C, Ding Y, Li K (2018) Teaching–learning–based artificial bee colony for solar photovoltaic parameter estimation. Appl Energy 212:1578–1588

    Article  Google Scholar 

  35. Costa A, Alfieri A, Matta A, Fichera S (2015) A parallel tabu search for solving the primal buffer allocation problem in serial production systems. Comput Oper Res 64:97–112

    Article  MATH  Google Scholar 

  36. Mann H, Whitney D (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50–60

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

    Pedram Beldar

  2. Industrial Management, School of Engineering, University of Seville, Camino de los Descubrimientos, 41092, Seville, Spain

    Jose M. Framinan

  3. National Center for Ports and Shipping, Australian Maritime College, University of Tasmania, Tasmania, Australia

    Allahyar Ardakani

Authors
  1. Pedram Beldar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jose M. Framinan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Allahyar Ardakani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pedram Beldar.

Additional information

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

Beldar, P., Framinan, J.M. & Ardakani, A. Minimization of total completion time on a batch processing machine with arbitrary release dates: an effectual teaching–learning based optimization approach. Prod. Eng. Res. Devel. 13, 557–566 (2019). https://doi.org/10.1007/s11740-019-00906-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11740-019-00906-2

Keywords

Search

Navigation