Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-27T23:08:49.496Z Has data issue: false hasContentIssue false
  • English
  • Français

Branch-and-bound algorithm for total weighted tardinessminimization on parallel machines under release dates assumptions

Published online by Cambridge University Press:  05 July 2012

Imed Kacem ,
Nizar Souayah  and
Mohamed Haouari
Imed Kacem
Affiliation:
Universitéde Lorraine, LCOMS, UFR MIM, Ile du Saulcy, 57000 Metz, France. [email protected]
Nizar Souayah
Affiliation:
École Polytechnique de Tunisie, 2078 La Marsa, Tunisia
Mohamed Haouari
Affiliation:
École Polytechnique de Tunisie, 2078 La Marsa, Tunisia
Get access

Abstract

This paper deals with the parallel-machine scheduling problem with the aim of minimizingthe total (weighted) tardiness under the assumption of different release dates. Thisproblem has been proven to be NP-hard. We introduce some new lower and upper bounds basedon different approaches. We propose a branch-and-bound algorithm to solve the weighted andunweighted total tardiness. Computational experiments were performed on a large set ofinstances and the obtained results showed that our algorithms are efficient.

Keywords

Schedulingweighted tardinessparallel machinesbranch-and-boun
Type
Research Article
Information
RAIRO - Operations Research , Volume 46 , Issue 2 , April 2012 , pp. 125 - 147
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alidaee, B. and Rosa, D., Scheduling parallel machines to minimize total weighted and unweighted tardness. Comput. Oper. Res. 24 (1979) 75–788. Google Scholar
Anderson, E.J. and Nyirenda, J.C., Two new rules to minimize tardiness in a job shop. Int. J. Prod. Res. 28 (1990) 2277–2292. Google Scholar
Azizoglu, M. and Kirka, O., Tardiness minimization on parallel machines. Int. J. Prod. Econ. 55 (1998) 163–168. Google Scholar
Baptiste, P. and Le Pape,, C. Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optim. 2 (2005) 83–99. Google Scholar
Baptiste, P., Carlier, C. and Antoine, J., A branch, bound procedure to minimze total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158 (2004) 595–608. Google Scholar
Baptiste, P., Jouglet, A. and Savourey, D., Lower bounds for parallel machine scheduling problems. Int. J. Oper. Res. 3 (2008) 643–664. Google Scholar
Chen, S.J. and Lin, L., Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule. Int. J. Prod. Res. 37 (1999) 2939–2956. Google Scholar
Chu, C., A branch and bound algorithm to minimise total flow time with unequal release dates. Nav. Res. Logist. 39 (1992) 859–875. Google Scholar
Chu, C., A branch and bound algorithm to minimize total tardiness with release dates. Nav. Res. Logist. 39 (1992) 265–283. Google Scholar
Elmaghraby, S.E. and Park, S.H., Scheduling jobs on a number of identical machines. AIIE Trans. 6 (1974) 1–13. Google Scholar
Emmons, H., One machine sequencing to minimize certain functions of job tardiness. Oper. Res. 17 (1969) 701–715. Google Scholar
Koulamas, C., Polynomially solvable total tardiness problem : review and extensions. Int. J. Manage. Sci. 25 (1997) 235–239. Google Scholar
Lee, Y.H. and Pinedo, M., Scheduling jobs on parallel machines with sequence-dependent times. Eur. J. Oper. Res. 100 (1997) 464–474. Google Scholar
Mosheiov, G. and Oron, D., A note on the SPT heuristic for solving scheduling problems with generalized due dates. Comput. Oper. Res. 31 (2004) 645–655. Google Scholar
R. Nessah and C. Chu, An efficient branch and bound algorithm for the problem Pm | r j |  ∑ C j. Submitted manuscript.
Potts, C.N. and Van Wassenhove, L.N., A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33 (1985) 363–377. Google Scholar
A.H.G. Rinnooy Kan, Machine sequencing problem : classification, complexity and computaion. Nijhoff, The Hague (1976).
Shim, S.-O. and Kim, Y.-D., Scheduling on parallel identical machines to minimize total tardiness. Eur. J. Oper. Res. 177 (2007) 135–146. Google Scholar
Sherali, H.D. and Ulular, O., Conjugate gradient methods using quasi-Newton updates with inexact line searches. J. Math. Anal. Appl. 150 (1990) 359–377. Google Scholar
Souayah, N., Kacem, I., M. Haouari and C. Chu Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manage. 1 (2009) 30–69. Google Scholar
Su, L.-H. and Chen, C.-J., Minimizing totla tardiness on a single machine with unequal release dates. Eur. J. Oper. Res. 186 (2008) 496–503. Google Scholar
Tian, Z.J., Ng, C.T. and Cheng, T.C.E., On the single machine total tardiness problem. Eur. J. Oper. Res. 165 (2005) 843–846. Google Scholar
Yalaoui, F. and Chu, C., Parallel machines scheduling to minimize total tardiness. Int. J. Prod. Econ. 76 (2002) 265–279. Google Scholar
Yalaoui, F. and Chu, C., New exact method to solve the Pm | r j | ∑ C j schedule problem. Int. J. Prod. Econ. 100 (2005) 168–179.Google Scholar