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

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

DOI QR Code

Dispatching Rule based Job-Shop Scheduling Algorithm with Delay Schedule for Minimizing Total Tardiness

지연 스케쥴을 허용하는 납기최소화 잡샵 스케쥴링 알고리즘

  • Kim, Jae-Gon (Incheon National University, Department of Industrial and Management Engineering) ;
  • Bang, June-Young (Sungkyul University, Department of Industrial and Management Engineering)
  • 김재곤 (인천대학교 산업경영공학과) ;
  • 방준영 (성결대학교 산업경영공학부)
  • Received : 2018.11.05
  • Accepted : 2019.01.03
  • Published : 2019.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

Keywords

References

  1. Armentano, V.A. and Scrich, C.R., Tabu search for minimizing total tardiness in a job shop, International Journal of Production Economics, 2000, Vol. 63, No. 2, pp. 131-140. https://doi.org/10.1016/S0925-5273(99)00014-6
  2. Bang, J.-Y., Two-Level Hierarchical Production Planning for a Semiconductor Probing Facility, Journal of Society of Korea Industrial and Systems Engineering, 2015, Vol. 38, No. 4, pp. 159-167. https://doi.org/10.11627/jkise.2015.38.4.159
  3. Braune, R., Zapfel, G., and Affenzeller, M., Enhancing local search algorithms for solving job shops with minsum objectives by approximate move evaluation, Journal of Scheduling, 2013, Vol. 16, No. 5, pp. 495-518. https://doi.org/10.1007/s10951-012-0305-x
  4. Bulbul, K., A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, Computers and operations Research, 2011, Vol. 38, No. 6, pp. 967-983. https://doi.org/10.1016/j.cor.2010.09.015
  5. Chaudhry, I.A. and Khan, A.A., A research survey : review of flexible job shop scheduling techniques, International Transactions in Operational Research, 2016, Vol. 23, No. 3, pp. 551-591. https://doi.org/10.1111/itor.12199
  6. de Bontridder, K.M.J., Minimizing total weighted tardiness in a generalized job shop, Journal of Scheduling, 2005, Vol. 8, No. 6, pp. 479-496. https://doi.org/10.1007/s10951-005-4779-7
  7. Essafi, I., Mati, Y., and Dauzere-Peres, S., A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Computers and Operations Research, 2008, Vol. 35, No. 8, pp. 2599-2616. https://doi.org/10.1016/j.cor.2006.12.019
  8. Jayamohan, M.S. and Rajendran, C., New dispatching rules for job shop scheduling : A step forward, International Journal of Production Research, 2000, Vol. 38, No. 3, pp. 563-586. https://doi.org/10.1080/002075400189301
  9. Mattfeld, D.C. and Bierwirth, C., An efficient genetic algorithm for job shop scheduling with tardiness objectives, European Journal of Operational Research, 2004, Vol. 155, No. 3, pp. 616-630. https://doi.org/10.1016/S0377-2217(03)00016-X
  10. Park, K.M. and Jeong, S.J., A study on the improvement of work flow and productivity in complex manufacturing line by employing the effective process control methods, Journal of the Korea Academia-Industrial Cooperation Society, 2016, Vol. 17, No. 5 pp. 305-315. https://doi.org/10.5762/KAIS.2016.17.5.305
  11. Pinedo, M.L. and Singer, M., A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop, Naval Research Logistics, 1999, Vol. 46, No. 1, pp. 1-17. https://doi.org/10.1002/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#
  12. Singer, M. and Pinedo, M.L., Computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops, IIE Transactions, 1998, Vol. 30, pp. 109-119. https://doi.org/10.1080/07408179808966443
  13. Vepsalainen, A.P.J. and Morton, T.E., Priority rules for job shops with weighted tardiness costs, Management Science, 1987, Vol. 33, No. 8, pp. 1035-1047. https://doi.org/10.1287/mnsc.33.8.1035
  14. Zhang, R. and Wu, C., A neighbourhood property for the ob shop scheduling problem with application to hybrid particle swarm optimization, IMA Journal of Management Mathematics, 2013, Vol. 24, No. 1, pp. 111-134. https://doi.org/10.1093/imaman/dps020
  15. Zhang, R. and Wu, C., A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm, Journal of Applied Mathematics, 2012, Vol. 2012, pp. 1-17.
  16. Zhang, R. and Wu, C., A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Computers and Operations Research, 2011, Vol. 38, No. 5, pp. 854-867. https://doi.org/10.1016/j.cor.2010.09.014
  17. Zhang, R., Song, S., and Wu, C., A hybrid artificial bee colony algorithm for the job shop scheduling problem, International Journal of Production Economics, 2013, Vol. 141, No. 1, pp. 167-178. https://doi.org/10.1016/j.ijpe.2012.03.035

Cited by

  1. 색도 및 색순에 따른 그라비아 인쇄 공정의 작업 순서 결정 규칙 vol.43, pp.3, 2019, https://doi.org/10.11627/jkise.2020.43.3.010