Simple heuristic to minimize total tardiness in a single machine scheduling problem

被引：0
作者：
R. Panneerselvam
机构：
[1] Pondicherry University,Department of Management Studies, School of Management
来源：
The International Journal of Advanced Manufacturing Technology | 2006年 / 30卷
关键词：
Simple heuristic; Total tardiness;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper discusses a simple heuristic to minimize the total tardiness in a single machine scheduling problem. The problem of minimizing total tardiness in single machine scheduling is a combinatorial problem. Hence, heuristic development for such problems is inevitable. In this paper, an attempt has been made to develop a simple heuristic, alternatively called greedy heuristic, to minimize the total tardiness in a single machine scheduling problem with n independent jobs, each having its processing time and due date. Further, its solution accuracy is compared with the optimal solution of a set of randomly generated problems using an ANOVA experiment. From the ANOVA experiment, it is observed that the solution of the simple heuristic proposed in this paper does not differ significantly from the optimal solution at a significance level of 0.05.
引用
收藏
页码：722 / 726
页数：4
相关论文
共 29 条
  • [1] Baker KR(1982)A dynamic priority rule for sequencing against due dates J Oper Manag 3 37-42
  • [2] Bertrand JWM(2000)A note on ‘an efficient algorithm for the single-machine tardiness problem’ Int J Prod Econ 66 287-292
  • [3] Biskup D(1968)The one machine sequencing problem with delay costs J Ind Eng 19 105-108
  • [4] Piewitt W(1969)One machine scheduling to minimize certain functions of job tardiness Oper Res 17 701-715
  • [5] Elmaghraby SE(1962)A dynamic programming approach to sequencing problems J SIAM 10 196-210
  • [6] Emmons H(1999)A quick optimal algorithm for sequencing on one machine to minimize total tardiness Int J Prod Econ 60–61 549-555
  • [7] Held M(1994)Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates Nav Res Log 41 913-933
  • [8] Karp RM(2002)Minimizing total tardiness: a case study in an auto parts factory Int T Oper Res 9 371-379
  • [9] Hirakawa Y(1994)An efficient algorithm for the single machine tardiness problem Int J Prod Econ 36 213-219
  • [10] Kim YD(2003)A note on a well-known dispatching rule to minimize total tardiness Omega 31 137-140
123