최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기산업공학 = IE Interfaces, v.15 no.4, 2002년, pp.338 - 348
신현준 (Texas A&M University 산업공학과) , 김성식 (고려대학교 산업시스템정보공학과)
In this paper, we present a restricted tabu search(RTS) algorithm that schedules jobs on identical parallel machines in order to minimize the maximum lateness of jobs. Jobs have release times and due dates. Also, sequence-dependent setup times exist between jobs. The RTS algorithm consists of two ma...
Ali, A., Jatinder, N. D. G.and Tariq, A.(1999), A review of scheduling research involving set up considerations, The Internatiol journal of Management Science, 27(2).219-239
Armentano V.A. and Yamashita, D. S.(2000), Tabu search for scheduling on identical parallel machines to minimize mean tardiness, journal of Intelligent Manufacturing, 11(5),453-460
Crauwels, H. A.J. and Potts, C.N. (1998), Local search heuristics for the single machine total weighted tardiness scheduling problem, INFORMS journal on Computing, 10,341-350
Franca, P.M.,Gendreau.M..Laporte, G.and Muller. F.M.(1996),A tabu search heuristic for the multi processor scheduling problem with sequence dependent set up times, International journal of Production Economics. 43(2-3), 79-89
Gendreau, M.. Hertz, A. and Laporte, G. (1992), New insertion and post-optimization procedures for the traveling salesman problem. Operations Research, 40(6). 1086-1094
Glover, F.(1989), Tabu search-Part I, ORSA journal on Computing, 1, 190-206
Glover, F.(1990), Tabu search-Part II, ORSA journal on Computing, 2, 4-32
Guinet, A.(1993), Scheduling sequence-dependent jobs on identical parallel machines to minimize completion rime criteria, International journal of Production &search, 31(7), 1579-1594
Kim, S.Y. and Bobrowski, P.M.(1994), Impact on sequence-dependent setup times on job shop scheduling performance, International journal of Production &search, 32(7), 1503-1520
Laguna, M. and Velarde. J. L. G. (1991), A search heuristic for just-in-time scheduling in parallel machines, journal of Intelligent Manufacturing, 2(4), 253-260
Laguna, M.,Barnes.J. W.and Glover, F. (1991). Tabu search methods for single machine scheduling problem, journal of intelligent Manufacturing, 2(2), 63-74
Lawler, E L., Lensrra.J. K.., Rinnooy Kan, A.H. G. and Shmoys, D. B.(1993), Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science: Logistics of Production and Inventory, North Holland, 445-522
Lee, Y.H.,Bhaskran, K.and Pinedo, M.(1997), A heuristic to minimize the total weighted tardiness with sequence-dependent setups, IIE Transactions, 29(1), 45-52
Lee, Y. H. and Pinedo, M.(1997), Scheduling jobs on parallel machines with sequence-dependent setup times, European Journal of Operational Research, 100(3),464-474
Matsuo, H.,Sub, c. J. and Sullivan, R S. (1989), A controlled search simulated annealing method for the general job shop scheduling problem, Annals of Operation Research, 21(85-108)
Parker, R G.,Deane, R H. and Holmes. R.A. (1977), On the use of a vehicle routing algorithm for the parallel processor problems with sequence dependent changeover costs, AIIE Transactions, 9(2), 155-160
Ovacik, I. M. and Uzsoy, R (1995), Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times, International Journal of Production Research, 33(11), 3173-3192
Uzsoy,R.,http://palette.ecn.purdue.edu/~uzsoy2/Problems/parallellparameters.html
Vakharia, A. J. and Chang, Y.(1990), A simulated annealing approach to scheduling a manufacturing cell, 40, 559-577
※ AI-Helper는 부적절한 답변을 할 수 있습니다.