Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
M.L. Pinedo, Scheduling: Theory, Algorithms and Systems (Springer, Berlin, 2012)
R.L. Graham, Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)
M.R. Garey, D.S. Johnson, Computers and intractability: a Guide to the Theory of NP Completeness (1979)
C.Y. Lee, J.D. Massey, Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl. Math. 20, 233–242 (1988)
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)
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)
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)
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)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Bathrinath, S., Saravana Sankar, S., Ponnambalam, S.G., Jerin Leno, I. (2015). VNS-Based Heuristic for Identical Parallel Machine Scheduling Problem. In: Suresh, L., Dash, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Advances in Intelligent Systems and Computing, vol 324. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2126-5_74
Download citation
DOI: https://doi.org/10.1007/978-81-322-2126-5_74
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2125-8
Online ISBN: 978-81-322-2126-5
eBook Packages: EngineeringEngineering (R0)