최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Journal of Korean Society of Industrial and Systems Engineering = 한국산업경영시스템학회지, v.38 no.2, 2015년, pp.47 - 55
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. Co...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Aboudi, R. and Jornsten, K., Resource constrained assignment problems. Discrete Appl Math, 1990, Vol. 26, pp. 175-191.
Aggarwal, V., A lagrangean-relaxation method for the constrained assignment problem. Compu Oper Res, 1985, Vol. 12, No. 1, pp. 97-106.
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.
Alagoz, O. and Azizoglu, M., Rescheduling of identical parallel machines under machine eligibility constraints. Eur J Oper Res, 2003, Vol. 149, pp. 523-532.
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.
Azizoglu, M. and Alagoz, O., Parallel-machine rescheduling with machine disruptions. IIE Trans, 2005, Vol. 37, pp. 1113-1118.
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.
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.
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.
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.
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.
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.
Mazzola, J. and Neebe, A.W., Resource-constrained assignment scheduling. Oper Res, 1986, Vol. 34, pp. 560-572.
Murty, K., An algorithm for ranking all the assignments in order of increasing cost. Oper Res, 1968, Vol. 16, pp. 682-687.
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.
Papadimitriou, C.H. and Steiglitz, K., Combination Optimization : Algorithms and Complexity. Englewood Cliffs, NJ : Prentice Hall, 1982.
Pinedo, M.L., Scheduling : Theory, Algorithm, and Systems (3rd ed.) : Prentice Hall, 2008.
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.
Shabtay, D. and Steniner, G., A survey of scheduling with controllable processing times. Discrete Appl Math, 2007, Vol. 155, pp. 1643-1666.
Vickson, R.G., Two single-machine sequencing problems involving controllable job processing times. AIIE Trans, 1980, Vol. 12, pp. 258-262.
Yang, B., Single machine rescheduling with new jobs arrivals and processing time compression. Inter J Adv Manuf Tech, 2007, Vol. 34, pp. 378-384.
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.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Free Access. 출판사/학술단체 등이 허락한 무료 공개 사이트를 통해 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.