Browse > Article

Scheduling Orders for Minimizing Total Weighted Tardiness  

Lee, Ik-Sun (동아대학교 경영학부)
Yoon, Sang-Hum (영남대학교 경영학부)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.33, no.2, 2008 , pp. 87-101 More about this Journal
Abstract
This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.
Keywords
Order Scheduling; Weighted Tardiness; Branch-and-Bound; Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Sung, C.S. and S.H. Yoon, "Minimizing Total Weighted Completion Time at a Preassembly Stage Composed of Two Feeding Machines," International Journal of Production Economics, Vol.54(1998), pp.247-255   DOI   ScienceOn
2 Yang, J. and M.E. Posner, "Scheduling Parallel Machines for the Customer Order Problem," Journal of Scheduling, Vol.8(2005), pp.49-74   DOI
3 Yoon, S.H. and C.S. Sung, "Fixed Pre-assembly Scheduling on Multiple Fabrication Machines," International Journal of Production Economics, Vol.96(2005), pp.109-118   DOI   ScienceOn
4 Leung, J.Y. T., H. Li, and M. Pinedo, "Order Scheduling Models with Applications in Practice, "Proceedings of the First Multidisciplinary International Conference on Scheduling：Theory and Applications(MISTA), Nottigham(2003), pp.2-10
5 Wang, G. and T.C.E. Cheng, "Customer Order Scheduling to Minimize Total Weighted Completion Time," to appear in Omega (2006)
6 Baker, K.R., "Heuristic Procedures for Scheduling Job Families with Setups and the Due Dates," Naval Research Logistics, Vol.46(1999), pp.978-991   DOI   ScienceOn
7 Leung, J.Y. T., H. Li, and M. Pinedo, "Approximation Algorithms for Minimizing Total Weighted Completion Time of Orders on Identical Machines in Parallel," Naval Research Logistics, Vol.53(2006), pp.243-260   DOI   ScienceOn
8 Maheswaran, R. and S.G. Ponnambalam, "An Investication on Single Machine Total Weighted Tardiness Scheduling Problems," International Journal of Advanced Manufacturing Technology, Vol.22(2003), pp.243-248   DOI
9 Peterkofsky, R.L. and C.F. Daganzo, "A Branch and Bound Solution for the Crane Scheduling Problem," Transportation Research, Vol.24B(1990), pp.159-172
10 Yang, J., Scheduling with Batch Objectives, Ph.D. Thesis, Industrial and Systems Engineering Graduate Program, The Ohio State University (1998)
11 Leung, J.Y. T., H. Li, and M. Pinedo, "Scheduling Orders for Multiple Product Types with Due Date Related Objectives," European Journal of Operational Research, Vol.168(2006), pp.370-389   DOI   ScienceOn
12 Ahmadi, R., U. Bagchi, and T.A. Roemer, "Coordinated Scheduling of Customer Orders for Quick Response," Naval Research Logistics, Vol.52(2005), pp.493-512   DOI   ScienceOn
13 Huegler, P.A. and F.J. Vasko, "A Performance Comparison of Heuristics for the Total Weighted Tardiness Problem," Computers and I.E., Vol.32(1997), pp.753-767   DOI   ScienceOn
14 Leung, J.Y. T., H. Li, and M. Pinedo, "Order Scheduling in an Environment with Dedicated Resources in Parallel," Journal of Scheduling, Vol.8(2005), pp.355-386   DOI
15 Pinedo, M., Scheduling：Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ, 1995
16 Kanet, J.J. and X. Li, "A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness," Journal of Scheduling, Vol.7(2004), pp.261-276   DOI   ScienceOn
17 Kim, Y.-D., "Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness," Journal of the Operational Research Society, Vol.44(1993), pp.19-28   DOI