Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

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

An Efficient Heuristic Technique for Job Shop Scheduling with Due Dates

납기를 갖는 job shop 일정계획의 효율적인 발견적기법

  • 배상윤 (전주공업전문대학 공업경영과) ;
  • 김여근 (전남대학교 공과대학 산업공학과)
  • Published : 1996.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

Keywords

References

  1. Management Science v.34 no.3 The Shifting Bottleneck Procedure for Job Shop Scheduling Adams,J.;E.Balas;D.Zawack
  2. International Journal of Production Research v.28 no.12 Two New Rules to Minimize Tardiness in a Job Shop Anderson,E.J.;J.C.Nyirenda
  3. Introduction to Sequencing and Scheduling Baker,K.R.
  4. Management Science v.30 Sequencing Rules and Due-Date Assignments in a Job Shop Baker,K.R.
  5. Journal of Operations Management v.3 A Dynamic Priority Rule for Scheduling against Due-Dates Baker,K.R.;J.W.Bertrand
  6. Journal of Operations Management v.4 Job Shop Scheduling with Modified Due Dates Baker,K.R.;J.J.Kanet
  7. Journal of Industrial Engineering v.16 no.4 Priority Dispatching and Job Lateness in a Job Shop Conway,R.W.
  8. Journal of Operations Management v.7 no.4 A Simulation Study of Processing Time Dispatching Rules Fry,T.D.;P.R.Philipoom;J.H.Blackstone
  9. Operations Research v.8 Algorithms for Solving Production Scheduling Problems Giffler,B.;G.L.Thompson
  10. International Journal of Production Research v.31 no.11 A Multiple-Pass Heuristic Rule for Jop Shop Scheduling with Due Dates He,Z.;T.Y.Yang;D.E.Deal
  11. European Journal of Operational Research v.69 The Job Shop Tardiness Problem: A Decomposition Approach Raman,N.;F.B.Talbot
  12. Journal of Operations Management v.8 no.2 Due Date based Scheduling in a General Flexible Manufacturing System Raman,N.;F.B.Talbot and R.V.Rachamadugu
  13. International Journal of Production Research v.25 no.10 A Comparative of the COVERT job Sequencing Rule using Various Shop Performance Measures Russell,R.S.;E.M.Dae-El;B.W.Taylor,Ⅲ
  14. International Journal of Production Research v.21 no.1 An Expediting Heuristic for the Shortest Processing Time Dispatching Rule Schultz,C.R.
  15. Computers & Operations Research v.22 no.2 Effective Job Shop Scheduling through Active Chain Manipulation Sun,D.;R.Batta;L.Lin
  16. Management Science v.33 no.8 Priority Rules for Job Shops with Weighted Tardiness Costs Vepsalainen,A.P.J.;T.E.Morton
  17. International Journal of Production Research v.23 no.23 Scheduling/Rescheduling in the Manufacturing Operating System Environment Yamamoto,M.;S.Y.Nof