참고문헌
- 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 https://doi.org/10.1002/nav.20092
- Baker, K.R., "Heuristic Procedures for Scheduling Job Families with Setups and the Due Dates," Naval Research Logistics, Vol.46(1999), pp.978-991 https://doi.org/10.1002/(SICI)1520-6750(199912)46:8<978::AID-NAV7>3.0.CO;2-D
- 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 https://doi.org/10.1016/S0360-8352(97)00015-6
- 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 https://doi.org/10.1023/B:JOSH.0000031421.64487.95
- Kim, Y.-D., "Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness," Journal of the Operational Research Society, Vol.44(1993), pp.19-28 https://doi.org/10.1057/jors.1993.3
- 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
- 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 https://doi.org/10.1007/s10951-005-2860-x
- 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 https://doi.org/10.1016/j.ejor.2004.03.030
- 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 https://doi.org/10.1002/nav.20138
- 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 https://doi.org/10.1007/s00170-002-1466-0
- 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
- Pinedo, M., Scheduling:Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ, 1995
- 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 https://doi.org/10.1016/S0925-5273(97)00151-5
- Wang, G. and T.C.E. Cheng, "Customer Order Scheduling to Minimize Total Weighted Completion Time," to appear in Omega (2006)
- Yang, J., Scheduling with Batch Objectives, Ph.D. Thesis, Industrial and Systems Engineering Graduate Program, The Ohio State University (1998)
- Yang, J. and M.E. Posner, "Scheduling Parallel Machines for the Customer Order Problem," Journal of Scheduling, Vol.8(2005), pp.49-74 https://doi.org/10.1007/s10951-005-5315-5
- 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 https://doi.org/10.1016/j.ijpe.2004.03.005