Abstract
This paper addresses a permutation flowshop scheduling problem, with the objective of minimizing total weighted squared tardiness. The focus is on providing efficient procedures that can quickly solve medium or even large instances. Within this context, we first present multiple dispatching heuristics. These include general rules suited to various due date-related environments, heuristics developed for the problem with a linear objective function, and procedures that are suitably adapted to take the squared objective into account. Then, we describe several improvement procedures, which use one or more of three techniques. These procedures are used to improve the solution obtained by the best dispatching rule. Computational results show that the quadratic rules greatly outperform the linear counterparts, and that one of the quadratic rules is the overall best performing dispatching heuristic. The computational tests also show that all procedures significantly improve upon the initial solution. The non-dominated procedures, when considering both solution quality and runtime, are identified. The best dispatching rule, and two of the non-dominated improvement procedures, are quite efficient, and can be applied to even very large-sized problems. The remaining non-dominated improvement method can provide somewhat higher quality solutions, but it may need excessive time for extremely large instances.
Similar content being viewed by others
References
Alidaee B, Ramakrishnan KR (1996) A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem. Comput Ind Eng 30:201–209
Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Op Manage 3:37–42
Dalfard VM, Ardakani A, Banihashemi TN (2011) Hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times. Tehnicki Vjesnik 18:467–504
Fernandez-Viagas V, Framinan JM (2015a) NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput Op Res 60:27–36
Fernandez-Viagas V, Framinan JM (2015b) A new set of high-performing heuristics to minimise flowtime in permutation flowshops. Comput Op Res 53:68–80
Fernandez-Viagas V, Leisten R, Framinan JM (2016) A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst Appl 61:290–301
Fernandez-Viagas V, Ruiz R, Framinan JM (2017) A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation. Eur J Op Res 257:707–721
Fernandez-Viagas V, Valente JMS, Framinan JM (2018) Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Syst Appl 94:58–69
Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Op Res Soc 55:1243–1255
Gonçalves TC, Valente JMS, Schaller JE (2016) Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Op Res 70:115–126
Hasija S, Rajendran C (2004) Scheduling in flowshops to minimize total tardiness of jobs. Int J Prod Res 42:2289–2301
Hoitomt DJ, Luh PB, Max E, Pattipati KR (1990) Scheduling jobs with simple precedence constraints on parallel machines. IEEE Control Syst Mag 10:34–40
Holsenback JE, Russell RM, Markland RE, Philipoom PR (1999) An improved heuristic for the single-machine, weighted-tardiness problem. Omega 27:485–495
Jackson JR (1955) Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Research Report 43. University of California, Los Angeles
Kanet JJ, Li XM (2004) A weighted modified due date rule for sequencing to minimize weighted tardiness. J Sched 7:261–276
Karabulut K (2016) A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput Ind Eng 98:300–307
Luh PB, Hoitomt DJ (1993) Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Trans Autom Control 38:1066–1079
Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91–95
Neufeld JS, Gupta JND, Buscher U (2016) A comprehensive review of flowshop group scheduling literature. Comput Op Res 70:56–74
Osman IH, Belouadah H, Fleszar K, Saffar M (2009), Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints. In: Paper presented at the MISTA 2009—multidisciplinary international conference on scheduling: theory and applications, Dublin, Ireland
Ow PS, Morton TE (1988) Filtered beam search in scheduling. Int J Prod Res 26:35–62
Panwalkar SS, Iskander W (1977) Survey of scheduling rules. Op Res 25:45–61
Potts CN, van Wassenhove LN (1991) Single-machine tardiness sequencing heuristics. IIE Trans 23:346–354
Reza Hejazi S, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43:2895–2929
Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Op Res 165:479–494
Ruiz R, Stützle T (2008) An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Op Res 187:1143–1159
Schaller J, Valente JMS (2012) Minimizing the weighted sum of squared tardiness on a single machine. Comput Op Res 39:919–928
Schaller J, Valente JMS (2018) Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput Ind Eng 119:146–156
Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59–66
Sun XQ, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113–124
Sun Y, Zhang C, Gao L, Wang X (2011) Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. Int J Adv Manuf Technol 55:723–739
Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes. Asian Productivity Organization, Tokio
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Op Res 64:278–285
Thomalla CS (2001) Job shop scheduling with alternative process plans. Int J Prod Econ 74:125–134
Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Op Res 35:3696–3713
Valente JMS, Schaller JE (2012) Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Op Res 39:2223–2231
Vallada E, Ruiz R (2010) Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38:57–67
Vallada E, Ruiz R, Minella G (2008) Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput Op Res 35:1350–1373
Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manage Sci 33:1035–1047
Volgenant A, Teerhuis E (1999) Improved heuristics for the n-job single-machine weighted tardiness problem. Comput Op Res 26:35–44
Acknowledgements
The authors would like to thank the two anonymous referees, and the associate editor, for their helpful comments and suggestions, which have improved this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Costa, M.R.C., Valente, J.M.S. & Schaller, J.E. Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem. Flex Serv Manuf J 32, 487–522 (2020). https://doi.org/10.1007/s10696-019-09363-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-019-09363-6