VNS-Based Heuristic for Identical Parallel Machine Scheduling Problem

  • S. Bathrinath
  • S. Saravana Sankar
  • S. G. Ponnambalam
  • I. Jerin Leno
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 324)


Minimization of make span and minimization of number of tardy jobs in identical parallel machine scheduling problems are proved to be NP-hard problems. Many researchers have attempted to solve these combinatorial optimization problems by employing different heuristic algorithms. While providing a satisfactory solution to the production environment for each of the above-said objectives, still remains as a challenge, most of the time, the need has been to have satisfactory solutions optimizing simultaneously the above-said two objectives. In this research work, an attempt is made to address this issue and heuristic algorithms using simulated annealing algorithm (SA) and variable neighborhood search algorithm (VNS) have been developed to provide near-optimal solutions. The developed heuristics are tested for their efficiency on a very large data sets generated as per the prescribed procedure found in the literature. Based on the results of experiments, it is inferred that the VNS-based heuristics outperforms the SA-based heuristics consistently both in terms of solution quality and consistency.


Identical parallel machine scheduling Variable neighborhood search algorithm Simulated annealing algorithm Make span Number of tardy jobs 


  1. 1.
    M.L. Pinedo, Scheduling: Theory, Algorithms and Systems (Springer, Berlin, 2012)CrossRefGoogle Scholar
  2. 2.
    R.L. Graham, Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    M.R. Garey, D.S. Johnson, Computers and intractability: a Guide to the Theory of NP Completeness (1979)Google Scholar
  4. 4.
    C.Y. Lee, J.D. Massey, Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl. Math. 20, 233–242 (1988)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    J.N.D. Gupta, A.J. Ruiz-Torres, A LISTFIT heuristic for minimizing makes span on identical parallel machines. Prod. Plannand Control 12, 28–36 (2001)CrossRefGoogle Scholar
  6. 6.
    W.C. Lee, C.C. Wu, P. Chen, A simulated Annealing approach to make span minimization on identical parallel machines. Int. J. Adv. Manuf. Technol. 31, 328–334 (2006)CrossRefGoogle Scholar
  7. 7.
    Y.C. Liang, Y.M. Hsiao, C.Y. Tien, Metaheuristics for drilling operation scheduling in Taiwan PCB industries. Int. J. Prod. Econ. 141(1), 189–198 (2013)CrossRefGoogle Scholar
  8. 8.
    M.J. Geiger, Randomised variable neighbourhood search for multi objective optimisation. In Proceedings of EU/ME Workshop: Design and Evaluation of Advanced Hybrid Meta-Heuristics, pp. 34–42 (2004)Google Scholar
  9. 9.
    C. Briand, S. Ourari, Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds. RAIRO-Oper. Res. 47(1), 33–46 (2013)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Y. Yin, C.C. Wu, W.H. Wu, C.J. Hsu, W.H. Wu, A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Appl. Soft Comput. 13(2), 1042–1054 (2013)CrossRefGoogle Scholar
  11. 11.
    S. Bathrinath, S. Saravanasankar, S.G. Ponnambalam, B.K.V. Kannan, Bi-objective optimization in identical parallel machine scheduling problem. In SEMCCO 2013, vol. 8297, pp. 377–388 (2013)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • S. Bathrinath
    • 1
  • S. Saravana Sankar
    • 1
  • S. G. Ponnambalam
    • 2
  • I. Jerin Leno
    • 3
  1. 1.Kalasalingam UniversityKrishnankoil, VirudhunagarIndia
  2. 2.Monash University MalaysiaBandar SunwayMalaysia
  3. 3.National College of EngineeringTirunelveliIndia

Personalised recommendations