최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기산업경영시스템학회지 = Journal of society of korea industrial and systems engineering, v.30 no.1, 2007년, pp.115 - 121
이경화 (한양대학교 산업공학과) , 정인재 (한양대학교 산업공학과)
In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permu...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
김여근, 윤복식, 이상복; '메타휴리스틱 : 유전 알고리듬.시뮬레이티드 어닐링.타부서치', 영지문화사, 1999
Adiri, I., Bruno, J., Frostig, E., and Rinnooy Kan, A. H. G.; 'Single machine flow-time scheduling with a single breakdown,' Acta Informatica, 26 : 679-696, 1989
Aggoune, R.; 'Minimizing the makespan for the flow shop scheduling problem with availability constraints,' European Journal of Operational Research, 153 : 534-543, 2004
Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., Schmidt, G.; 'Heuristic algorithms for the two-machine flowshop problem with limited machine availability,' Omega Journal, 29 : 599-608, 2001
Blazewicz, J., Formanowicz, P., Kubiak, W., Przysuch, M. Schmidt, G.; 'Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability,' Bulletin of the Polish Academy of Sciences, Technical Sciences, 2000
Gen, M. and Cheng, R.; Genetic Algorithms and engineering design, A Wiley Interscience Publication, 1997
Holland, J.; Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975
Kubiak, W., Blazewicz, J., Formanowicz, P., and Breit, J., Schmidt, G.; 'Two-machine flow shops with limited machine availability,' European Journal of Operational Research, 136 : 528-540., 2002
Lee, C.-Y.; 'Parallel machines scheduling with non-simultaneous machine available time,' Discrete Applied Mathematics, 30 : 53-61, 1991
Lee, C.-Y., Liman, S. D.; 'Capacitated two-parallel machines scheduling to minimize sum of job completion times,' Discrete Applied Mathematics, 41 : 211-222, 1993
Lee, C.-Y.; 'Machine scheduling with an availability constraint,' Journal of Global Optimization, 9 : 395-416, 1995
Lee, C.-Y.; 'Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint,' Operations Research Letters, 20 : 129-139, 1997
Lee, C.-Y.; 'Two-machine flowshop scheduling with availability constraints,' European Journal of Operational Research, 114 : 420-429, 1999
Schmidt, G.; 'Scheduling on semi-identical processors,' Zeitschrift fur Operations Research, 28 : 153-162, 1984
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.