Abstract
The single machine scheduling problems minimizing total weighted tardiness and square tardiness objectives have been studied in literature for many years. Applications of the model include sequencing problems in manufacture and logistics. This paper proposes two new priority allocation rules, PAR 1 and PAR 2, for solving these two problems. Unlike most known dispatch rules and constructive algorithms, our new rules take advantage of not only the jobs’ static characters values such as the process time, the due date and the weight, but also their dynamic characters values, i.e., the slack and the values of the objective function for different choices of some jobs. At any time when a job is being selected to process, some of the unprocessed jobs are delayed while the others are not. It means that the characters of these two sorts of jobs are different from each other. So, combining these characters with the objective function’s value can obtain effective dispatch rule. Experimental analysis based on the instances from the OR-Library discloses that our priority allocation rules, PAR 1 and PAR 2, are efficient and have significant advantages over traditional approaches.
Similar content being viewed by others
References
Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59–66
Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manag Sci 24(5):530–534
Mason SJ, Fowler JW, Carlyle WM (2002) A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J Sched 5:247–262
Lenstra JK, Rinnoy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362
Potts CN, Van Wassenhove LN (1985) A branch and bound algorithm for total weighted tardiness problem. Oper Res 33:363–377
Vepsalainen AP, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manag Sci 33:1035–1047
Kanet JJ, Li X (2004) A weighted modified due date rule for sequencing to minimize weighted tardiness. J Sched 7:261–276
Valente Jorge MS, Schaller Jeffrey E (2012) Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput Oper Res 39:2223–2231
Schaller Jeffrey E, Valente Jorge MS (2012) Minimizing the weighted sum of squared tardiness on a single machine. Comput Oper Res 39:919–928
Avci S, Akturk MS, Storer RH (2003) A problem space algorithm for single machine weighted tardiness problems. IIE Trans 35:479–486
Ergun Ö, Orlin JB (2006) Fast neighborhood search for the single machine total weighted tardiness problem. Oper Res Lett 34:41–45
Bilge Ü, Kurtulan M, Kıraç F (2007) A tabu search algorithm for the single machine total weighted tardiness problem. Eur J Oper Res 176:1423–1435
Nearchou AC (2004) Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm. In: Proceedings of the 2nd IEEE international conference on industrial informatics INDIN’04, Berlin, Germany, pp 513–516
Geiger M (2011) New instances for the single machine total weighted tardiness problem. http://edoc.sub.unihmburg.de/hsu/volltexte/2011/2808/pdf/RR-10-03-01.pdf
Acknowledgments
This research is supported by the National Natural Science Foundation of China No. 61262011 and the Natural Science Foundation of Jiangxi Province No. 20142BAB207024.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yin, A., Punnen, A.P. & Hu, D. Priority allocation rules for single machine total weighted linear and square tardiness problems. Prod. Eng. Res. Devel. 10, 471–476 (2016). https://doi.org/10.1007/s11740-016-0680-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11740-016-0680-9