작업 도착시점 제약이 존재하는 2단계 흐름공정에서의 일정계획 연구
Heuristic Algorithms for a Two-Machine Flowshop Scheduling Problem with Distinct Release Times of Jobs
정봉주(LG생산기술원); 방준영(성결대학교); 심상오(한밭대학교)
34권 4호, 15~25쪽
초록
We consider a scheduling problem of a two-machine flowshop for the objective of minimizing the total tardiness of distinct release times of jobs. We proposed the mathematical model and obtain the optimal solutions by CPLEX. Since this problem is known to be NP-hard, several heuristic algorithms for the large sized problem. For evaluation of the proposed algorithms, we perform computational experiments on randomly generated instances and compare the performance of heuristic algorithms and simulated annealing. Results of the experiments show that the proposed algorithms can give very reasonable solutions in short time.
Abstract
We consider a scheduling problem of a two-machine flowshop for the objective of minimizing the total tardiness of distinct release times of jobs. We proposed the mathematical model and obtain the optimal solutions by CPLEX. Since this problem is known to be NP-hard, several heuristic algorithms for the large sized problem. For evaluation of the proposed algorithms, we perform computational experiments on randomly generated instances and compare the performance of heuristic algorithms and simulated annealing. Results of the experiments show that the proposed algorithms can give very reasonable solutions in short time.
- 발행기관:
- 한국경영과학회
- 분류:
- 경영학