Management Science and Financial Engineering

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

DOI QR Code

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu (Department of Industrial Engineering, Hanyang University) ;
  • Yu, Jae-Min (Department of Industrial Engineering, Hanyang University) ;
  • Lee, Dong-Ho (Department of Industrial Engineering and Graduate School of Technology and Innovation Management, Hanyang University)
  • Received : 2012.12.18
  • Accepted : 2013.01.18
  • Published : 2013.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

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. Baker, K. R. and G. D. Scudder, "Sequencing with earliness and tardiness penalties: a review," Operations Research 38 (1990), 22-36. https://doi.org/10.1287/opre.38.1.22
  3. Balakrishnan, N., J. J. Kanet, and V. Sridharan, "Early/tardy scheduling with sequence dependent setups on uniform parallel machines," Computers and Operations Research 26 (1999), pp. 127-141. https://doi.org/10.1016/S0305-0548(98)00051-3
  4. 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
  5. 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
  6. 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
  7. Cheng, T. C. E., "A heuristic for common due-date assignment and job scheduling on parallel machines," Journal of the Operational Research Society 40(1989), 1129-1135. https://doi.org/10.1057/jors.1989.194
  8. 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
  9. 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
  10. 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
  11. De, P., J. B. Ghosh, and C. E. Wells, "Due-date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics 41 (1994), 17-32. https://doi.org/10.1002/1520-6750(199402)41:1<17::AID-NAV3220410103>3.0.CO;2-X
  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 Tranactions 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. Emmons, H., "Scheduling to a common due date on parallel uniform processors," Naval Research Logistics 34 (1987), 803-810. https://doi.org/10.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2
  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. Hall, N. G., "Scheduling problems with generalized duedates," IIE Transactions 18 (1986), 220-222. https://doi.org/10.1080/07408178608975351
  18. Hall, N. G., "Single and multiple processor models for minimizing completion variances," Naval Research Logistics 33 (1986), 49-54. https://doi.org/10.1002/nav.3800330105
  19. 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
  20. Kim, J.-G., J.-S. Kim, and D.-H. Lee, "Common duedate assignment and sequencing with sequencedependent setup times: a case study on a paper remanufacturing system," Management Science and Financial Engineering 18 (2012), 1-12. https://doi.org/10.7737/MSFE.2012.18.2.001
  21. Kim, J-.G., J.-S. Kim, and D-.H. Lee, "Fast and metaheuristics for common due-date assignment and scheduling on parallel machines," International Journal of Production Research 60 (2012), 6040-6057.
  22. Kim, S.-I., H-.S. Choi, and D-.H. Lee, "Scheduling algorithms for parallel machines with sequencedependent setup and distinct ready times: minimizing total tardiness," Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 221 (2007), 1087-1096. https://doi.org/10.1243/09544054JEM779
  23. Min, L. and W. Cheng, "Genetic algorithms for the optimal common due-date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems," Robotics and Computer-Integrated Manufacturing 22 (2006), 279-287. https://doi.org/10.1016/j.rcim.2004.12.005
  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. Sundararaghavan, P. S. and M. U. Ahmed, "Minimizing the sum of absolute lateness in single-machine and multi-machine scheduling," Naval Research Logistics 31 (1984), 325-333. https://doi.org/10.1002/nav.3800310214
  28. Xia, Y., B. Chen and J. Yue, "Job sequencing and duedate assignment in a single machine shop with uncertain processing times," European Journal of the Operational Research 184 (2008), 63-75. https://doi.org/10.1016/j.ejor.2006.10.058
  29. Xiao, W. Q. and C. L. Li, "Approximation algorithms for common due-date assignment and job scheduling on parallel machines," IIE Transactions 34 (2002), 467-477. https://doi.org/10.1023/A:1013567219570