Skip to main content

Advertisement

SpringerLink
Log in

Minimizing the number of tardy jobs and maximum earliness in the single machine scheduling using an artificial immune system

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Nowadays, the importance of timely delivery, which is based on the just in time concept, has caused a number of criteria related to scheduling problems to be taken into consideration. One of the most important of these criteria is maximum earliness to control final costs and number of tardy jobs in an attempt to win customer satisfaction. In this paper, the strongly NP-hard problem of the single machine scheduling with two criteria, i.e., maximum earliness and number of tardy jobs, has been considered. For this purpose, artificial immune system which is inspired by the immunology theory in biology has been used. This algorithm is applied to different instances of small to large sizes and the obtained results is compared with those obtained from a heuristic method and a genetic algorithm reported in the literature. Computational results show a significant preference for the algorithm proposed in this paper.

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

Similar content being viewed by others

References

  1. KR Baker (1974) Introduction to sequencing and scheduling. Wiley, Chichester

    Google Scholar 

  2. Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623

    Article  MathSciNet  MATH  Google Scholar 

  3. Wan G, Yen BPC (2009) Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. Eur J Oper Res 195:89–97

    Article  MathSciNet  MATH  Google Scholar 

  4. Güner E, Erol S, Tani K (1998) One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs. Int J Prod Econ 55:213–219

    Article  Google Scholar 

  5. Köksalan M (1999) A Heuristic approach to bicriteria scheduling. Nav Res Logist 46:777–789

    Article  MATH  Google Scholar 

  6. Azizoglu M, Kondakci S, Köksalan M (2003) Single machine scheduling with maximum earliness and number tardy. Comput Ind Eng 45:257–268

    Article  Google Scholar 

  7. Jolai F, Rabbani M, Amalnick S, Dabaghi A, Dehghan M, Yazdan Parast M (2007) Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs. Appl Math Comput 194:552–560

    Article  MathSciNet  MATH  Google Scholar 

  8. Moore JM (1968) An n job one machine sequencing algorithm for minimizing the number of late jobs. Manage Sci 15:102–109

    Article  MATH  Google Scholar 

  9. Engin O, Döyen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener Comput Syst 20:1083–1095

    Article  Google Scholar 

  10. Chandrasekaran M, Asokan P, Kumanan S, Balamurugan T, Nickolas S (2006) Solving job shop scheduling problems using artificial immune system. Int J Adv Manuf Technol 31:580–593

    Article  Google Scholar 

  11. Tavakoli-Moghadam R, Rahimi-Vahed A, Hosein Mirzaei A (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072–5090

    Article  Google Scholar 

  12. Hong L (2009) A novel artificial immune algorithm for job shop scheduling. Proceeding of 2009 International Conference on Computational Intelligence and Natural Computing. CINC 1:38–41. doi:10.1109/CINC.2009.238

    Google Scholar 

  13. Naderi B, Khalili M, Tavakkoli-Moghaddam R (2009) A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput Ind Eng 56:1494–1501

    Article  Google Scholar 

  14. Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job–shop scheduling problem. Future Gener Comput Syst 26:533–541

    Article  Google Scholar 

  15. Gao J (2010) A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint. Comput Ind Eng 58:602–609

    Article  Google Scholar 

  16. Lee CY, Vairaktarakis GL (1993) Complexity of single machine hierarchical scheduling: a survey. Complex Numer Optim 19:269–298

    MathSciNet  Google Scholar 

  17. De Castero LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evol Comput 6:239–251

    Article  Google Scholar 

  18. Engelbrecht AP (2007) Computational intelligence: an introduction, 2nd edn. Wiley, Chichester

    Google Scholar 

  19. Agarwal R, Tiwari MK, Mukherjee SK (2007) Artificial immune system based approach for solving resource constrained project scheduling problem. Int J Adv Manuf Technol 34:584–593

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran

    Mohammad Reisi & Ghasem Moslehi

Authors
  1. Mohammad Reisi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ghasem Moslehi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ghasem Moslehi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reisi, M., Moslehi, G. Minimizing the number of tardy jobs and maximum earliness in the single machine scheduling using an artificial immune system. Int J Adv Manuf Technol 54, 749–756 (2011). https://doi.org/10.1007/s00170-010-2978-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2978-7

Keywords

Search

Navigation