Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Dispatching Rule based on Chromaticity and Color Sequence Priorities for the Gravure Printing Operation

색도 및 색순에 따른 그라비아 인쇄 공정의 작업 순서 결정 규칙

  • Bae, Jae-Ho (Dept. of Industrial Engineering, Osan University)
  • Received : 2020.07.06
  • Accepted : 2020.08.24
  • Published : 2020.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

Keywords

References

  1. Allahverdi, A. and Soroush, H.M., The significance of reducing setup time/setup costs, European Journal of Operational Research, 2008, Vol. 187, No. 3, pp. 978-984. https://doi.org/10.1016/j.ejor.2006.09.010
  2. Barker, J.R. and McMahon, G.B., Scheduling the general jobshop, Management Science, 1985, Vol. 31, No. 5, pp. 594-598. https://doi.org/10.1287/mnsc.31.5.594
  3. Choi, J.S., Kang, I.S., and Park, C.W., Dispatching rule of automated guided vehicle to minimize makespan under jobshop condition, Journal of Society of Korea Industrial and Systems Engineering, 2001, Vol. 24, No. 62, pp. 97-109.
  4. Choi, Y.C., Dispatching rule-based scheduling algorithms in a single machine with sequence-dependent setup times and energy requirements, Procedia CIRP, 2016, Vol. 41, pp. 135-140. https://doi.org/10.1016/j.procir.2015.12.109
  5. Defersha, F.M. and Chen, M.Y., Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time, International Journal of Production Research, 2012, Vol. 50, No. 8, pp. 2331- 2352. https://doi.org/10.1080/00207543.2011.574952
  6. Floudas, C.A. and Lin, X., Continuous-time versus discrete- time approaches for scheduling of chemical processes : A review, Computers and Chemical Engineering, 2004, Vol. 28, No. 11, pp. 2109-2129. https://doi.org/10.1016/j.compchemeng.2004.05.002
  7. Floudas, C.A. and Lin, X., Mixed integer linear programming in process scheduling : modeling, algorithms, and applications, Annals of Operations Research, 2005, Vol. 139, No. 1, pp. 131-162. https://doi.org/10.1007/s10479-005-3446-x
  8. French, S., Sequencing and scheduling : An introduction to the mathematics of the job-shop, New York : Ellis Horwood, 1982.
  9. Garey, M.R., Johnson, D.S., and Sethi, R.R., The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1976, Vol. 1, No. 2, pp. 117-129. https://doi.org/10.1287/moor.1.2.117
  10. Graves, S.C., A review of production scheduling, Operations Research, 1981, Vol. 29, No. 4, pp. 646-675. https://doi.org/10.1287/opre.29.4.646
  11. Ingimundardottir, H. and Runarsson, T.P., Supervised learning linear priority dispatch rules for job-shop scheduling, International Conference on Learning and Intelligent Optimization, 2011, Berlin : Springer, pp. 263-277 (http://link.springer.com/chapter/10.1007%2F978-3-642-25566-3_20).
  12. Johnson, S.M., Optimal two and three stage production schedules with setup times included, Naval Research Logistics Quarterly, 1954, Vol. 1, No. 1, pp. 61-68. https://doi.org/10.1002/nav.3800010110
  13. Ju, Q.Y., Planning and scheduling optimization of jobshop in intelligent manufacturing system [dissertation], [Nanjing, China] : Nanjing University of Aeronautics and Astronautics, 2007.
  14. Kim, J.K. and Bang J.Y., Dispatching rule based jobshop scheduling algorithm with delay schedule for minimizing total tardiness, Journal of Society of Korea Industrial and Systems Engineering, 2019, Vol. 42, No. 1, pp. 33-40. https://doi.org/10.11627/jkise.2019.42.1.033
  15. Lin et al., Network modeling and evolutionary optimization for scheduling in manufacturing, Journal of Intelligent Manufacturing, 2012, Vol. 23, No. 6, pp. 2237-2253. https://doi.org/10.1007/s10845-011-0569-6
  16. Manikas, A. and Chang, Y.L., Multi-criteria sequencedependent job shop scheduling using genetic algorithms, Computers and Industrial Engineering, 2009, Vol. 56, No. 1, pp. 179-185. https://doi.org/10.1016/j.cie.2008.05.002
  17. Morton, T. and Pentico, D.W., Heuristic scheduling systems : With applications to production systems and project management, London : Wiley, 1993.
  18. Panwalker, S.S. and Iskander, W., A survey of scheduling rules, Operations Research, 1977, Vol. 25, No.1, pp. 45-61. https://doi.org/10.1287/opre.25.1.45
  19. Paul, M., Sridharan, R., and Ramanan, T.R., A multiobjective decision-making framework using preference selection index for assembly job shop scheduling problem, International Journal of Management Concepts and Philosophy, 2016, Vol. 9, No. 4, pp. 362-387. https://doi.org/10.1504/IJMCP.2016.079843
  20. Pinedo, M., Scheduling : Theory, Algorithms and Systems, Englewood Cliffs : Prentice-Hall, 1995.
  21. Sharma, P. and Jain, A., Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times, Frontiers of Mechanical Engineering, 2014, Vol. 9, No. 4, pp. 380-389. https://doi.org/10.1007/s11465-014-0315-9
  22. Sharma, P. and Jain, A., New setup-oriented dispatching rules for a stochastic dynamic job shop manufacturing system with sequence-dependent setup times, Concurrent Engineering Research Applications, 2016, Vol. 24, No. 1, pp. 58-68. https://doi.org/10.1177/1063293X15599814
  23. Thenarasu, M., Rameshkumar, K., Anbuudayasankar, S. P., Arjunbarath, G., and Ashok, P., Development and selection of hybrid dispatching rule for dynamic job scheduling using multi-criteria decision making analysis (MCDMA), IJQR, 2020, Vol. 14, No. 2, pp. 340-364.
  24. Zahmani et al., Multiple priority dispatching rules for the job shop scheduling problem, In 2015 3rd international conference on control, engineering and information technology (CEIT) IEEE, 2015, pp. 1-6.
  25. Zhang, J., Ding, G., Zou, Y., Qin, S., and Fu, J., Review of job shop scheduling research and its new perspectives under Industry 4.0, Journal of Intelligent Manufacturing, 2017, Vol. 30, No. 4, pp. 1809-1830.