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

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

DOI QR Code

Parallel Machine Scheduling with Identical Jobs and Sequence-Independent Setup Times

순서 독립적인 셋업타임을 가진 동일작업의 병렬기계 배치스케줄링

  • Choi, Byung-Cheon (Department of Business Administration, Chungnam National University) ;
  • Park, Myoung-Ju (Department of Industrial and Management Systems Engineering, Kyung Hee University)
  • Received : 2014.06.20
  • Accepted : 2014.08.06
  • Published : 2014.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

We consider the problem of scheduling identical jobs with sequence-independent setup times on parallel machines. The objective is to minimize total completion times. We present the pseudopolynomial-time algorithm for the case with a fixed number of machines and an efficient approximation algorithm for our problem with identical setup times, which is known to be NP-hard even for the two-machine case.

Keywords

References

  1. Ahuja, R.A., K. Mehlhorn, and J.B. Orlin, "Faster algorithm for the shortest path problem," Journal of the Association for Computing Machinery, Vol.37(1990), pp.213-223. https://doi.org/10.1145/77600.77615
  2. Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan, "A review of scheduling research involving setup considerations," Omega, Vol.27(1999), pp.219-239. https://doi.org/10.1016/S0305-0483(98)00042-5
  3. Allahverdi, A., C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov, "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Vol.187(2008), pp.985-1032. https://doi.org/10.1016/j.ejor.2006.06.060
  4. Baker, K.R. and D. Trietsch, Principles of Scheduling and Sequencing, John Wiley and Sons, Inc, 2009.
  5. Cheng, T.C.E. and Z.L. Chen, "Parallel machine scheduling with batch setup times," Operations Research, Vol.42(1994), pp.1171-1174. https://doi.org/10.1287/opre.42.6.1171
  6. Liu, Z., W. Yu, and T.C.E. Cheng, "Scheduling groups of unit length jobs on two identical parallel machines," Information Processing Letters, Vol.69(1999), pp.275-281. https://doi.org/10.1016/S0020-0190(99)00026-5
  7. Webster, S.T., "The complexity of scheduling job families about a common due date," Operations Research Letters, Vol.20(1997), pp. 65-74. https://doi.org/10.1016/S0167-6377(96)00054-5
  8. Webster, S.T. and M. Azzioglu, "Dynamic programming algorithms for scheduling parallel machines with family setup times," Computers and Operations Research, Vol.28(2001), pp.127-137. https://doi.org/10.1016/S0305-0548(99)00094-5