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

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

Batch Scheduling of Incompatible Job Families with Sequence Independent Setup Times

공정 교체 시간을 고려한 배치작업의 일정계획

  • 김주일 (연세대학교 컴퓨터과학·산업시스템공학과) ;
  • 이영훈 (연세대학교 기계전자공학부 정보산업공학전공)
  • Published : 2001.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.

Keywords

References

  1. 한국시뮬레이션 학회지 v.9 no.3 주문변화를 반영한 스케줄링 규칙에 대한 시뮬레이션을 이용한 성능평가 박종관;이용훈
  2. Operations Research v.39 Dominance and decomposition heuristic for single machine scheduling Chambers, R.J.;R.L. Carraway;T.J. Lowe;T.L. Morin
  3. International Journal of Production Research v.31 Minimizing total completion time on batch processing machines Chandru, V.;C.Y. Lee;R. Uzsoy
  4. Operation Research Letters v.13 Minimizing total completion time on batch processing machine with job families Chandru, V.;C.Y. Lee;R. Uzsoy
  5. Mathematics of Operations Research v.15 Minimizing total tardiness on one machine is NP-hard Du, J.;J.Y.T. Leung
  6. IEEE Transactions on semiconductor manufacturing v.11 Due date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility Kim, Y.D.;J.U. Kim;S.K. Lim;H.B. Jun
  7. Annals of Discrete Mathematics v.1 A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness Lawler, E.L.
  8. Operations Research v.40 Efficient algorithms for scheduling batch processing machines Lee, C.Y.;R. Uzsoy;L. A. Martin Vega
  9. IIE Transactions v.29 A heuristic to minimize the total weighted tardiness with sequence-dependent setups Lee, Y.H.;K. Bhaskaran;M. Pinedo
  10. European Journal of Operational Research v.100 Scheduling jobs on parallel machines with sequence-dependent setup times Lee, Y.H.;M. Pinedo
  11. IIE Transactions v.30 Minimizing total tardiness on a batch processing machine with incompatible job families Mehta, S.V.;R. Uzsoy
  12. Myopic heuristics for the single machine weighted tardiness problem Morton, T.E.;R.M. U. Rachamadugu
  13. Computers & Industrial Engineering v.38 Scheduling jobs on parallel machines applying neural network and heuristic rules Park, Y.S.;S.Y. Kim;Y.H. Lee
  14. Operations Research v.33 A branch and bound algorithm for the total weighted tardiness problem Potts, C.N.;L.N. Van Wassenhove
  15. European Journal of Operational Research v.40 Real-time scheduling of an automated manufacturing center Raman, N.;R.V. Rachamadugu;F.B. Talbot
  16. Operations Research v.18 Dynamic programming solution of sequencing problems with precedence constraints Schrage, L.;K.R. Baker
  17. International Journal of Production Research v.33 Scheduling batch processing machines with incompatible job families Uzsoy, R.
  18. Management Science v.33 Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs Vepsalainen, A.;T.E. Morton