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

  • 제38권2호
  • /
  • Pages.47-55
  • /
  • 2015
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지
DOI QR코드

DOI QR Code

작업시간이 압축 가능한 경우 병렬기계의 재일정계획

Rescheduling on Parallel Machines with Compressible Processing Times

  • 김수환 (국방대학교 군사운영분석학과)
  • Kim, Suhwan (Department of Military Operations Research, Korea National Defense University)
  • 투고 : 2015.02.03
  • 심사 : 2015.03.20
  • 발행 : 2015.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

키워드

참고문헌

  1. Aboudi, R. and Jornsten, K., Resource constrained assignment problems. Discrete Appl Math, 1990, Vol. 26, pp. 175-191. https://doi.org/10.1016/0166-218X(90)90099-X
  2. Aggarwal, V., A lagrangean-relaxation method for the constrained assignment problem. Compu Oper Res, 1985, Vol. 12, No. 1, pp. 97-106. https://doi.org/10.1016/0305-0548(85)90011-5
  3. Akturk, M.S., Atamturk, A., and Gurel, S., Parallel machine match-up scheduling with manufacturing cost considerations. J Sched, 2010, Vol. 13, pp. 95-110. https://doi.org/10.1007/s10951-009-0111-2
  4. Alagoz, O. and Azizoglu, M., Rescheduling of identical parallel machines under machine eligibility constraints. Eur J Oper Res, 2003, Vol. 149, pp. 523-532. https://doi.org/10.1016/S0377-2217(02)00499-X
  5. Alidaee, B. and Ahmadian, A., Two parallel machine sequencing problems involving controllable job processing times. Eur J Oper Res, 1993, Vol. 70, pp. 335-341. https://doi.org/10.1016/0377-2217(93)90245-I
  6. Azizoglu, M. and Alagoz, O., Parallel-machine rescheduling with machine disruptions. IIE Trans, 2005, Vol. 37, pp. 1113-1118. https://doi.org/10.1080/07408170500288133
  7. Cheng, T.C.E., Chen, Z.L., and Li, C.L., Parallel-machine scheduling with controllable processing times. IIE Trans, 1996, Vol. 28, pp. 177-180. https://doi.org/10.1080/07408179608966263
  8. Curry, J. and Peters, B., Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. Inter J Prod Res, 2005, Vol. 43, No. 15, pp. 3231-3246. https://doi.org/10.1080/00207540500103953
  9. Gupta, A. and Sharma, J., Tree search method for optimal core management of pressurized water reactors. Compu Oper Res, 1981, Vol. 8, No. 4, pp. 263-266. https://doi.org/10.1016/0305-0548(81)90013-7
  10. Gurel, S. and Cincioglu, D., Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives. Int J Prod Res, 2015, Vol. 53, No. 9, pp. 2751-2770. https://doi.org/10.1080/00207543.2014.980452
  11. Gurel, S. and Akturk, M.S., Considering manufacturing cost and scheduling performance on a CNC turning machine. Eur J Oper Res, 2007, Vol. 177, pp. 325-343. https://doi.org/10.1016/j.ejor.2005.11.029
  12. Lieshout, P.M.D. and Volgenant, A., A branch-andbound algorithm for the singly constrained assignment problem. Eur J Oper Res, 2007, Vol. 176, pp. 151-161. https://doi.org/10.1016/j.ejor.2005.05.028
  13. Mazzola, J. and Neebe, A.W., Resource-constrained assignment scheduling. Oper Res, 1986, Vol. 34, pp. 560-572. https://doi.org/10.1287/opre.34.4.560
  14. Murty, K., An algorithm for ranking all the assignments in order of increasing cost. Oper Res, 1968, Vol. 16, pp. 682-687. https://doi.org/10.1287/opre.16.3.682
  15. Ozlen, M. and Azizouglu, M., Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. Int J Prod Res, 2009, Vol. 47, No. 19, pp. 5245-5270. https://doi.org/10.1080/00207540802043998
  16. Papadimitriou, C.H. and Steiglitz, K., Combination Optimization : Algorithms and Complexity. Englewood Cliffs, NJ : Prentice Hall, 1982.
  17. Pinedo, M.L., Scheduling : Theory, Algorithm, and Systems (3rd ed.) : Prentice Hall, 2008.
  18. Punnen, A. and Aneja, Y.P., A tabu search algorithm for the resource-constrained assignment problem. J Oper Res Soc, 1995, Vol. 46, pp. 214-220. https://doi.org/10.1057/jors.1995.26
  19. Shabtay, D. and Steniner, G., A survey of scheduling with controllable processing times. Discrete Appl Math, 2007, Vol. 155, pp. 1643-1666. https://doi.org/10.1016/j.dam.2007.02.003
  20. Vickson, R.G., Two single-machine sequencing problems involving controllable job processing times. AIIE Trans, 1980, Vol. 12, pp. 258-262. https://doi.org/10.1080/05695558008974515
  21. Yang, B., Single machine rescheduling with new jobs arrivals and processing time compression. Inter J Adv Manuf Tech, 2007, Vol. 34, pp. 378-384. https://doi.org/10.1007/s00170-006-0590-7
  22. Yin, N. and Wang, X.Y., Single-machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol, 2011, Vol. 54, pp. 743-748. https://doi.org/10.1007/s00170-010-2973-z