Abstract
This chapter deals with the parallel machines scheduling problem to minimize the total tardiness , when jobs have different release dates . Preemption and splitting are not allowed and machines are considered identical. Since one machine scheduling problem is NP-Hard then parallel machines scheduling problem is NP-Hard too. In this paper we develop a mathematical model which describes the parallel machine scheduling problem and provides optimal solutions of small size instances. Moreover, heuristic methods are provided to solve all instances. Finally, we propose a Tabu Inspired Heuristic (TIH) to get good solutions. Computational tests are driven performing over 1,000 different instances based on literature to identify the most effective structure for the proposed heuristic algorithm to minimize total tardiness. The obtained results are discussed and analyzed.
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
References
Armentano VA, Yamashita DS (2000) Tabu search for scheduling on identical parallel machines to minimize mean tardiness. J Intell Manuf 11:453–460
Azizoglu M, Kirca O (1998) Tardiness minimization on parallel machines. Int J Product Econ 55(2):163–168
Bilge U, Kirac F, Kurtulan M, Pekgun P (2004) A tabu search algorithm for parallel machine total tardiness problem. Comput Oper Res 31(3):397–414
Biskup D, Herrmann J, Gupta JND (2008) Scheduling identical parallel machines to minimize total tardiness. Int J Product Econ 115(1):134–142
Dugardin F, Chehade H, Amodeo L, Yalaoui F, Prins C (2007) Hybrid Job Shop and parallel machine scheduling problems: minimization of total tardiness criterion, chapter 16, pages 273–292. Adv Robot Syst J. ISBN: 978-3-902613-02-8.
Jougle A, Savourey D (2011) Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. Comput Oper Res 38:1259–1266
Koulamas C (1994) The total tardiness problem: review and extensions. Oper Res 42:1025–1041
Koulamas C (2009) The single-machine total tardiness scheduling problem: review and extensions. Eur J Oper Res 202:1–7
Lamothe J, Marmier F, Dupuy M, Gaborit P, Dupont L (2012) Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. Comput Oper Res 39(6):1236–1244
Lawler EL (1964) On scheduling problems with deferral costs. Manag Sci 11:280–288
Sorensen K (2007) Distance measures based on the edit distance for permutation-type representations. J Heuristics 13:35–47
Tanaka S, Araki M (2008) A branch-and-bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines. Int J Product Econ 113(1):446–458
Yalaoui F (2012) Minimizing total tardiness in parallel-machine scheduling with release dates. Appl Evol Comput 3:21–46
Yalaoui F, Chu C (2002) Parallel machine scheduling to minimize total tardiness. Int J Product Econ 76(3):265–279
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Lara, A.F.B., Yalaoui, F., Dugardin, F., Entzmann, F. (2016). An Efficient Heuristic to Minimize the Total Tardiness in the Parallel Machines Scheduling Problem. In: Talbi, EG., Yalaoui, F., Amodeo, L. (eds) Metaheuristics for Production Systems. Operations Research/Computer Science Interfaces Series, vol 60. Springer, Cham. https://doi.org/10.1007/978-3-319-23350-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-23350-5_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23349-9
Online ISBN: 978-3-319-23350-5
eBook Packages: Business and ManagementBusiness and Management (R0)