Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Common Due-Date Assignment and Scheduling with Sequence-Dependent Setup Times: a Case Study on a Paper Remanufacturing System

  • Kim, Jun-Gyu (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Ji-Su (Department of Industrial Engineering, Hanyang University) ;
  • Lee, Dong-Ho (Department of Industrial Engineering/Graduate School of Technology and Innovation Management, Hanyang University)
  • Received : 2011.09.24
  • Accepted : 2012.03.16
  • Published : 2012.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

Keywords

References

  1. Baker, K. R. and G. D. Scudder, "On the assignment of optimal due-dates," Journal of the Operational Research Society 40 (1989), 93-95. https://doi.org/10.1057/jors.1989.9
  2. Birman, M. and G. Mosheiov, "A note on due-date assignment in a two-machine flow-shop," Computers and Operations Research 31 (2004), 473-480. https://doi.org/10.1016/S0305-0548(02)00225-3
  3. Biskup, D. and H. Jahnke, "Common due-date assignment for scheduling on a single machine with jointly reducible processing times," International Journal of Production Economics 69 (2001), 317-322 https://doi.org/10.1016/S0925-5273(00)00040-2
  4. Bouchriha, H. M., and D'Ouhimmou, S., "Amours, "Lot sizing problem on a paper machine under a cyclic production approach," International Journal of Production Economics 105 (2007), 318-328. https://doi.org/10.1016/j.ijpe.2005.07.001
  5. Chen, D. W., S. Li, and G. C. Tang, "Single machine scheduling with common due date assignment in a group technology environment," Mathematical and Computer Modelling 25 (1997), 81-90. https://doi.org/10.1016/S0895-7177(97)00017-4
  6. Chen, Z. L., "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research 93 (1996), 49-60. https://doi.org/10.1016/0377-2217(95)00133-6
  7. Cheng, T. C. E., "A note on the common due-date assignment problem," Journal of the Operational Research Society 37 (1986), 1089-1091. https://doi.org/10.1057/jors.1986.186
  8. Cheng, T. C. E., "Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs," Engineering Optimization 16 (1990), 129-136. https://doi.org/10.1080/03052159008941168
  9. Cheng, T. C. E. and M. Y. Kovalyov, "Bath scheduling and common due-date assignment on a single machine," Discrete Applied Mathematics 70 (1996), 231-245. https://doi.org/10.1016/0166-218X(96)80468-9
  10. Cheng, T. C. E., C. Oguz, and X. D. Qi, "Due-date assignment and single machine scheduling with compressible processing times," International Journal of Production Economics 43 (1996), 29-35. https://doi.org/10.1016/0925-5273(95)00194-8
  11. Cheng, T. C. E., Z. L. Chen, and N. V. Shakhlevich, "Common due-date assignment and scheduling with ready times," Computers and Operations Research 29 (2002), 1957-1967. https://doi.org/10.1016/S0305-0548(01)00067-3
  12. De, P., J. B. Ghosh, and C. E. Wells, "On the multiplemachine extension to a common due-date assignment and scheduling problem," Journal of the Operational Research Society 42 (1991), 419-422 https://doi.org/10.1057/jors.1991.84
  13. Diamond, J. E. and T. C. E. Cheng, "Error bound for common due date assignment and job scheduling on parallel machines," IIE Transactions 32 (2000), 445-448.
  14. Dvir, S. and S. George, "Two due date assignment problems in scheduling a single machine," Operations Research Letters 34 (2006), 683-691. https://doi.org/10.1016/j.orl.2005.10.009
  15. Dvir, S., "Due date assignments and scheduling a single machine with a general earliness and tardiness cost function," Computers and Operations Research 35 (2008), 1539-1545. https://doi.org/10.1016/j.cor.2006.08.017
  16. Gordon, V., J. M. Proth, and C. Chu, "A survey of the state-of-the-art of the common due-date assignment and scheduling research," European Journal of Operational Research 139 (2002), 1-25. https://doi.org/10.1016/S0377-2217(01)00181-3
  17. Gupta, D. and T. Magnusson, "The capacitated lot-sizing scheduling problem with sequenced-dependent setup costs and setup times," Computers and Operations Research 32 (2005), 727-747. https://doi.org/10.1016/j.cor.2003.08.014
  18. Hall, N. G., "Scheduling problems with generalized due dates," IIE Transactions 18 (1986), 220-222. https://doi.org/10.1080/07408178608975351
  19. Kim, H.-C., J.-G. Kim, and D.-H. Lee, "A case study on capacitated lot-sizing and scheduling in a paper remanufacturing system," Technical Report, Department of Industrial Engineering, Hanyang University, Seoul, South Korea (2008).
  20. Kim, J.-G. and D.-H. Lee, "Algorithms for common due-date assignment and sequencing in a single machine with sequence-dependent setup times," Journal of the Operational Research Society 60 (2009), 1264-1272. https://doi.org/10.1057/jors.2008.95
  21. Li, C.-L., G. Mosheiov, and U. Yovel, "An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs," Computers and Operations Research 35 (2008), 3612-3619. https://doi.org/10.1016/j.cor.2007.03.006
  22. Lund, R. T., "Remanufacturing," Technology Review 87 (1984), 18-28.
  23. Mosheiov, G., "A common due-date assignment problem on parallel identical machines," Computers and Operations Research 28 (2001), 719-732. https://doi.org/10.1016/S0305-0548(99)00127-6
  24. Ng, C. T. D., T. C. E. Cheng., M. Y. Kovalyov, and S. S. Lam, "Single machine scheduling with a variable common due date and resource-dependent processing times," Computers and Operations Research 30 (2003), 1173-1185. https://doi.org/10.1016/S0305-0548(02)00066-7
  25. Panwalkar, S. S., M. L. Smith, and A. Seidmann, "Common due-date assignment to minimize total penalty for the one machine scheduling problem," Operations Research 30 (1982), 391-399. https://doi.org/10.1287/opre.30.2.391
  26. Quaddus, M. A., "A generalized model of optimal duedate assignment by linear programming," Journal of the Operational Research Society 38 (1987), 353-359. https://doi.org/10.1057/jors.1987.58
  27. Rabadi, G., M. Mollaghasemi, and G. C. Anagnostopoulos, "A branch-and-bound algorithm for the early/ tardy machine scheduling problem with a common due-date and sequence-dependent setup time," Computers and Operations Research 31 (2004), 1727- 1751. https://doi.org/10.1016/S0305-0548(03)00117-5
  28. Xia, Y., B. Chen, and J. Yue, "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research 184 (2008), 63-75. https://doi.org/10.1016/j.ejor.2006.10.058

Cited by

  1. Multiple Equipment Integrated Scheduling and Storage Space Allocation in Rail–Water Intermodal Container Terminals Considering Energy Efficiency pp.2169-4052, 2019, https://doi.org/10.1177/0361198118825474