표제지
초록
목차
Abbreviation 11
Nomenclature 12
제1장 서론 14
제2장 Unrelated parallel machine scheduling problem 24
제3장 방법론 30
제3.1절 제약 프로그래밍 30
제3.2절 제약 만족 문제(CSP) 32
제3.3절 CP 기반 4-queens 문제 최적화 33
제4장 문제 정의 38
제5장 모델링 42
제5.1절 OPL 정의 42
제5.2절 CP 기반 선표 수립 최적화 모델 46
제6장 CP 모델 검증 55
제6.1절 실적 결과와의 비교를 통한 성능 검증 56
제6.2절 조립 공정 부하를 고려하는 선표 수립 최적화 모델 검증 59
제6.3절 다중 목적함수에 대한 가중치 분석 61
제7장 사례 연구 65
제7.1절 수립 대상 호선 척 수에 따른 결과분석 65
제7.2절 실험요약 및 기타 지표 분석 71
제8장 결론 76
참고 문헌 78
Abstract 81
Table 2-1. Example of processing time for UPM with 4 jobs and 2 machines 25
Table 2-2. Comparison results of 4 algorithms for UPMSP 28
Table 4-1. Constraint satisfaction problem of berth planning 41
Table 5-1. OPL for CP model 43
Table 6-1. Ship data for validation of constraint satisfaction 57
Table 6-2. Berth information for validation of constraint satisfaction 57
Table 6-3. Berth-shiptype priority for validation 57
Table 6-4. Result comparison between proposed model and heuristic 58
Table 6-5. Ship data for validation of workload constraint 59
Table 6-6. Berth priority by shiptype for validation of multi-objective functions 60
Table 6-7. Ship data for validation of weights on multi-objective functions 62
Table 6-8. Result of the objective functions value by weight case 63
Table 7-1. Ship data for KPI analysis 66
Table 7-2. Berth priority by shiptype for KPI analysis 66
Table 7-3. Optimization results for KPI analysis 68
Table 7-4. Solutions in the range of objective function value trade off 69
Table 7-5. Indices according to size of problem 75
Figure 1-1. Scheduling process of shipbuilding 14
Figure 1-2. Example of berth schedule 19
Figure 1-3. Berth scheduling process 20
Figure 1-4. Objective of proposed model 23
Figure 2-1. Example of PMSP with 4 jobs and 2 machines 24
Figure 2-2. Gantt chart of result by SPT 25
Figure 3-1. Example of states in 4-queens problem;(a): impossible state, (b): possible state 33
Figure 3-2. 4-queens problem search tree with simple back tracking 34
Figure 3-3. 4-queens problem search tree with forward checking 35
Figure 3-4. 4-queens problem search tree with maintaining arc consistency 35
Figure 3-5. Comparison of propagation techniques 36
Figure 4-1. Example of ship batch on a berth 39
Figure 5-1. Definition of interval variable 43
Figure 5-2. Mechanism of alternative constraint 44
Figure 5-3. Example of step function(t → h) 45
Figure 5-4. Example of pulse function(t₁ → h, t₂ → 0) 45
Figure 5-5. Structure for ship variable 47
Figure 5-6. Division of berth A in CP model 48
Figure 5-7. Structure of ship variable(a)at the graving berth,(b)at the floating berth 50
Figure 5-8. Process of workstage priority calculation 51
Figure 5-9. (a)Impossible batch of parallel-tandem ship (b)Possible batch of parallel-tandem ship 54
Figure 6-1. Comparison of result for daily workload;(a)CP model without workload constraint, (b) CP model with workload constraint 61
Figure 6-2. Pareto frontier by non-dominant solutions of weight case 64
Figure 7-1. Value of objective functions(small size problem) 68
Figure 7-2. Value of objective functions(big size problem) 70
Figure 7-3. Example of increased leadtime occurrence 71
Figure 7-4. Example of berth plan for continuous batch:(a)worse case, (b)better case 73