본문 바로가기
KERD
논문KCI 등재

Rescheduling on Parallel Machines with Compressible Processing Times

김수환
한국산업경영시스템학회 (KOREAN SOCIETY OF INDUSTRIAL AND SYSTEMS ENGINEERING)|2015.06|한국산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)|제38권 제2호|pp. 47-55

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

HeuristicReschedulingParallel MachinesCompressible Processing Time
주제분류산업공학

초록

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.

Abstract

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.

참고문헌 (22)

  1. Aboudi, R., "Resource constrained assignment problems", Discrete Appl Math, 26, pp.175~191 (1990)
  2. Aggarwal, V., "A lagrangean-relaxation method for the constrained assignment problem", Compu Oper Res, 12(1), pp.97~106 (1985)
  3. Akturk, M. S., "Parallel machine match-up scheduling with manufacturing cost considerations", J Sched, 13, pp.95~110 (2010)
  4. Alagoz, O., "Rescheduling of identical parallel machines under machine eligibility constraints", Eur J Oper Res, 149, pp.523~532 (2003)
  5. Alidaee, B., "Two parallel machine sequencing problems involving controllable job processing times", Eur J Oper Res, 70, pp.335~341 (1993)
  6. Azizoglu, M., "Parallel-machine rescheduling with machine disruptions", IIE Trans, 37, pp.1113~1118 (2005)
  7. Cheng, T. C. E., "Parallel-machine scheduling with controllable processing times", IIE Trans, 28, pp.177~180 (1996)
  8. Curry, J., "Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives", Inter J Prod Res, 43(15), pp.3231~3246 (2005)
  9. Gupta, A., "Tree search method for optimal core management of pressurized water reactors", Compu Oper Res, 8(4), pp.263~266 (1981)
  10. Gurel, S., "Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives", Int J Prod Res, 53(9), pp.2751~2770 (2015)
  11. Gurel, S., "Considering manufacturing cost and scheduling performance on a CNC turning machine", Eur J Oper Res, 177, pp.325~343 (2007)
  12. Lieshout, P.M.D., "A branch-andbound algorithm for the singly constrained assignment problem", Eur J Oper Res, 176, pp.151~161 (2007)
  13. Mazzola, J., "Resource-constrained assignment scheduling", Oper Res, 34, pp.560~572 (1986)
  14. Murty, K., "An algorithm for ranking all the assignments in order of increasing cost", Oper Res, 16, pp.682~687 (1968)
  15. Ozlen, M., "Generating all efficient solutions of a rescheduling problem on unrelated parallel machines", Int J Prod Res, 47(19), pp.5245~5270 (2009)
  16. Papadimitriou, C.H., "Combination Optimization : Algorithms and Complexity" (1982), Prentice Hall
  17. Pinedo, M. L, "Scheduling : Theory, Algorithm, and Systems" (2008), Prentice Hall
  18. Punnen, A., "A tabu search algorithm for the resource-constrained assignment problem", J Oper Res Soc, 46, pp.214~220 (1995)
  19. Shabtay, D., "A survey of scheduling with controllable processing times", Discrete Appl Math, 155, pp.1643~1666 (2007)
  20. Vickson, R. G., "Two single-machine sequencing problems involving controllable job processing times", AIIE Trans, 12, pp.258~262 (1980)
  21. Yang, B., "Single machine rescheduling with new jobs arrivals and processing time compression", Inter J Adv Manuf Tech, 34, pp.378~384 (2007)
  22. Yin, N., "Single-machine scheduling with controllable processing times and learning effect", Int J Adv Manuf Technol, 54, pp.743~748 (2011)

관련 논문AI추천

A Review on Scheduling Problems for Minimizing the Number of Late Jobs김흥규, 최재영한국생산관리학회 · 한국생산관리학회지2011 · 제22권 제2호Minimizing the total completion time in a two-stage flexible flow shop윤석훈중소기업융합학회 · 융합정보논문지2021 · 제11권 제8호Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획임승빈, 정인재, 조항민한국산업경영시스템학회 · 한국산업경영시스템학회지2007 · 제30권 제2호다중 서버의 이동 시간을 고려하는 병렬 머신 스케줄링정균락한국컴퓨터정보학회 · 한국컴퓨터정보학회논문지2017 · 제22권 제10호Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects최진영한국산업경영시스템학회 · 한국산업경영시스템학회지2015 · 제38권 제3호A Heuristic Algorithm to Minimize Mean Squared Deviation of Completion Times김채복, 이동훈, 한태창한국산업경영학회 · 경영연구2009 · 제24권 제2호

이 간행물의 다른 논문 (16건)

Analysis of Body Circumference Measures in Predicting Percentage of Body Fat박성하pp. 1-7게임화(Gamification)을 이용한 매장 관리 디자인 : 고객-매장관리자 협업모델백시현, 원즈허주pp. 8-16Quantifying the Process of Patent Right Quality Evaluation : Combined Application of AHP, Text Mining and Regression Analysis송재국, 류태규, 윤장혁pp. 17-30수직적으로 차별화된 제품시장 내에서 유통업체의 다자간 협상전략에 관한 연구조형래, 이민호, 임상규pp. 31-39An Approximation Approach for Solving a Continuous Review Inventory System Considering Service Cost이동주, 이창용pp. 40-46
원문 보기